Faith \& falsity

DOI10.1016/j.apal.2004.04.008zbMath1065.03038OpenAlexW4212913921MaRDI QIDQ705533

Albert Visser

Publication date: 31 January 2005

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2004.04.008

zbMATH Keywords

\(\Sigma\)-soundnessFaithful interpretationsRosser argumentsSequential theories

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Relative consistency and interpretations (03F25)

Related Items (23)

The Henkin Sentence ⋮ Friedman-reflexivity ⋮ Turing Jumps Through Provability ⋮ Extension and interpretability ⋮ Passive induction and a solution to a Paris-Wilkie open question ⋮ Some observations on the FGH theorem ⋮ ANOTHER LOOK AT THE SECOND INCOMPLETENESS THEOREM ⋮ The small‐is‐very‐small principle ⋮ Interpretability degrees of finitely axiomatized sequential theories ⋮ Pairs, sets and sequences in first-order theories ⋮ Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories ⋮ The Axiom System IΣ0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem ⋮ SELF-REFERENCE IN ARITHMETIC I ⋮ A generalization of the second incompleteness theorem and some exceptions to it ⋮ No escape from Vardanyan's theorem ⋮ PROVABILITY LOGICS RELATIVE TO A FIXED EXTENSION OF PEANO ARITHMETIC ⋮ Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem ⋮ The Interpretation Existence Lemma ⋮ Predicate Logics of Constructive Arithmetical Theories ⋮ MINIMAL TRUTH AND INTERPRETABILITY ⋮ MÜNCHHAUSEN PROVABILITY ⋮ The arithmetics of a theory ⋮ Neo-Logicism and Its Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The unprovability of small inconsistency. A study of local and global interpretability
• Self-reference and modal logic
• On the scheme of induction for bounded arithmetic formulas
• Fifty years of self-reference in arithmetic
• The formalization of interpretability
• A minimal predicative set theory
• Undecidable theories
• Modal analysis of generalized rosser sentences
• Cuts, consistency statements and interpretations
• A note on proofs of falsehood
• Rosser sentences
• An inside view of EXP; or, The closed fragment of the provability logic of IΔ₀ + Ω₁ with a prepositional constant for EXP
• A small reflection principle for bounded arithmetic
• Computer Science Logic
• Rules and arithmetics

This page was built for publication: Faith \& falsity