A new proof of Ajtai's completeness theorem for nonstandard finite structures
From MaRDI portal
(Redirected from Publication:2339960)
Recommendations
- Forcing in Finite Structures
- Generalizations of the Compactness Theorem and Gödel’s Completeness Theorem for Nonstandard Finite Structures
- Arithmetical completeness versus relative completeness
- scientific article; zbMATH DE number 1072417
- A model-theoretic approach to proof theory. Edited by Zofia Adamowicz, Teresa Bigorajska and Konrad Zdanowski
Cites work
- scientific article; zbMATH DE number 51556 (Why is no real title available?)
- scientific article; zbMATH DE number 819737 (Why is no real title available?)
- scientific article; zbMATH DE number 227056 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- An introduction to recursively saturated and resplendent models
- Generalizations of the Compactness Theorem and Gödel’s Completeness Theorem for Nonstandard Finite Structures
- Models with compactness properties relative to an admissible language
- Parity, circuits, and the polynomial-time hierarchy
- \(\Sigma_ 1^ 1\)-formulae on finite structures
Cited in
(5)- Saturated models and models that are generated by indiscernibles
- Construction of models of bounded arithmetic by restricted reduced powers
- scientific article; zbMATH DE number 3557786 (Why is no real title available?)
- Generalizations of the Compactness Theorem and Gödel’s Completeness Theorem for Nonstandard Finite Structures
- Resplendent models and \({\Sigma_1^1}\)-definability with an oracle
This page was built for publication: A new proof of Ajtai's completeness theorem for nonstandard finite structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339960)
