TRUTH AND FEASIBLE REDUCIBILITY

DOI10.1017/jsl.2019.24zbMath1444.03164arXiv1902.00392OpenAlexW3099755591MaRDI QIDQ5107235

Ali Enayat, Bartosz Wcisło, Mateusz Łełyk

Publication date: 17 April 2020

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.00392

zbMATH Keywords

reducibilityaxiomatic theories of truthconservativityspeed-uppolynomial simulationtruth predicatescompositional truthfeasible computations

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15) Models of arithmetic and set theory (03C62)

Related Items (6)

Local collection and end-extensions of models of compositional truth ⋮ The two halves of disjunctive correctness ⋮ AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW ⋮ Pathologies in satisfaction classes ⋮ INCOMPLETENESS VIA PARADOX AND COMPLETENESS ⋮ Truth and the philosophy of mathematics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How truthlike can a predicate be? A negative result
• An axiomatic approach to self-referential truth
• TRUTH AND SPEED-UP
• CONSERVATIVITY FOR THEORIES OF COMPOSITIONAL TRUTH VIA CUT ELIMINATION
• Notes on Formal Theories of Truth
• Construction of Satisfaction Classes for Nonstandard Models
• Reflecting on incompleteness
• Outline of a Theory of Truth
• DISJUNCTIONS WITH STOPPING CONDITIONS
• NOTES ON BOUNDED INDUCTION FOR THE COMPOSITIONAL TRUTH PREDICATE
• On mathematical instrumentalism
• MODELS OF PT^– WITH INTERNAL INDUCTION FOR TOTAL FORMULAE

This page was built for publication: TRUTH AND FEASIBLE REDUCIBILITY