Interpreting the compositional truth predicate in models of arithmetic

DOI10.1007/S00153-020-00758-ZOpenAlexW3127052585MaRDI QIDQ2042738

Cezary Cieśliński

Publication date: 21 July 2021

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-020-00758-z

zbMATH Keywords

cut eliminationtruthsatisfaction

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Models with special properties (saturated, rigid, etc.) (03C50)

Cites Work

• Unnamed Item
• Unnamed Item
• Inductive full satisfaction classes
• Deflationary truth and pathologies
• Full satisfaction classes: A survey
• Satisfaction classes via cut elimination
• Cut elimination theorem for second order arithmetic with the \(\Pi^ 1_ 1\)-comprehension axiom and the \(\omega\)-rule
• CONSERVATIVITY FOR THEORIES OF COMPOSITIONAL TRUTH VIA CUT ELIMINATION
• Nonstandard characterizations of recursive saturation and resplendency
• Construction of Satisfaction Classes for Nonstandard Models
• On Languages Which are Based on Non-Standard Arithmetic

This page was built for publication: Interpreting the compositional truth predicate in models of arithmetic