Syntactical truth predicates for second order arithmetic
From MaRDI portal
In the paper the notion of a syntactical truth predicate for second-order arithmetic is introduced and studied. This predicate can be seen as a counterpart to Tarski's notion of model-theoretical validity. It is shown that the existence of a syntactical truth predicate is equivalent to the existence of an \(\omega\)-model of second-order arithmetic.
Recommendations
Cites work
- A minimal model for set theory
- Degrees of unsolvability of constructible sets of integers
- scientific article; zbMATH DE number 51556 (Why is no real title available?)
- scientific article; zbMATH DE number 1226875 (Why is no real title available?)
- scientific article; zbMATH DE number 1144041 (Why is no real title available?)
- scientific article; zbMATH DE number 3217001 (Why is no real title available?)
- Proof theory
- Second order arithmetic and related topics
- Systems of predicative analysis
Cited in
(6)
This page was built for publication: Syntactical truth predicates for second order arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2732276)