Artykuł w czasopiśmie
Brak miniatury
Licencja
 

Local collection and end-extensions of models of compositional truth

Uproszczony widok
dc.abstract.enWe introduce a principle of local collection for compositional truth predicates and show that it is arithmetically conservative over the classically compositional the-ory of truth. This axiom states that upon restriction to formulae of any syntactic complexity, the resulting predicate satisfies full collection. In particular, arguments using collection for the truth predicate applied to sentences occurring in any given (code of a) proof do not suffice to show that the conclusion of that proof is true, in stark contrast to the case of the induction scheme.We analyse various further results concerning end-extensions of models of composi-tional truth and the collection scheme for the compositional truth predicate.
dc.affiliationUniwersytet Warszawski
dc.contributor.authorWcisło, Bartosz
dc.contributor.authorŁełyk, Mateusz
dc.date.accessioned2024-01-25T05:13:18Z
dc.date.available2024-01-25T05:13:18Z
dc.date.copyright2021-01-13
dc.date.issued2021
dc.description.accesstimeAT_PUBLICATION
dc.description.financePublikacja bezkosztowa
dc.description.number6
dc.description.versionFINAL_PUBLISHED
dc.description.volume172
dc.identifier.doi10.1016/J.APAL.2020.102941
dc.identifier.issn0168-0072
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/111402
dc.identifier.weblinkhttps://www.sciencedirect.com/science/article/pii/S0168007220301652?via%3Dihub
dc.languageeng
dc.pbn.affiliationphilosophy
dc.relation.ispartofAnnals of Pure and Applied Logic
dc.relation.pages102941
dc.rightsOther
dc.sciencecloudnosend
dc.subject.enModels of arithmetic
dc.subject.enTruth theory
dc.subject.enCompositional truth
dc.subject.enSatisfaction classes
dc.subject.enCollection scheme
dc.subject.enConservativeness
dc.titleLocal collection and end-extensions of models of compositional truth
dc.typeJournalArticle
dspace.entity.typePublication