Models of axiomatic systems
From MaRDI portal
Cited in
(15)- In memory of Andrzej Mostowski
- Independent axiomatizability of sets of sentences
- The logical strength of compositional principles
- Arithmetical completeness theorem for modal logic \(\mathsf{K}\)
- On partial disjunction properties of theories containing Peano arithmetic
- The implicit commitment of arithmetical theories and its semantic core
- Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\)
- Generalizations of Gödel's incompleteness theorems for \(\Sigma_n\)-definable theories of arithmetic
- Andrzej Mostowski and the notion of a model
- Independent Recursive Axiomatizability in Arithmetic
- A Non-Standard Truth Definition
- What languages have Tarski truth definitions?
- Incompleteness of boundedly axiomatizable theories
- Mathematical developments of the incompleteness theorems
- The modal logic of arithmetic potentialism and the universal algorithm
This page was built for publication: Models of axiomatic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5822066)