Barwise: Infinitary Logic and Admissible Sets
DOI10.2178/BSL/1080330272zbMATH Open1080.03026OpenAlexW2062229169MaRDI QIDQ4678932FDOQ4678932
Authors: H. Jerome Keisler, J. F. Knight
Publication date: 24 May 2005
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3555a5d1e3744df9a9ecdd2ef594ec67c08bf30d
Recommendations
History of mathematics in the 20th century (01A60) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) History of mathematical logic and foundations (03-03) Other infinitary logic (03C75) Logic on admissible sets (03C70)
Cites Work
- Title not available (Why is that?)
- The completeness of the first-order functional calculus
- Computable structures and the hyperarithmetical hierarchy
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
- Infinitary properties of abelian torsion groups
- Infinitary logic and admissible sets
- An introduction to recursively saturated and resplendent models
- Interpolation, preservation, and pebble games
- Scott sentences and admissible sets
- Metarecursive sets
- Persistent and invariant formulas relative to theories of higher order
- The next admissible set
- A hierarchy of formulas in set theory
- Models with compactness properties relative to an admissible language
- Hanf numbers for fragments of L\(_{\infty \omega}\)
- On Moschovakis closure ordinals
- Toward model theory through recursive saturation
- Stationary logic
- A generalization of the concept of ω-consistency
- An example concerning Scott heights
- Applications of Strict Π11 predicates to infinitary logic
- A guide to the identification of admissible sets above structures
- Global inductive definability
- The Hanf number of second order logic
- A generalization of the concept ofω-completeness
- On ω-consistency and related properties
- Lefschetz's principle
- On the partial recursive functions of ordinal numbers
- Kreiseliana: about and around Georg Kreisel
- Metarecursively enumerable sets and admissible ordinals
Cited In (10)
- On certain fundamental problems of mathematical logic
- INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES
- Title not available (Why is that?)
- Bounds on the strength of ordinal definable determinacy in small admissible sets
- Can logic be combined with probability? Probably
- Model theory for \(L_{\infty \omega _ 1}\)
- Embedding Linear-Time Temporal Logic into Infinitary Logic: Application to Cut-Elimination for Multi-agent Infinitary Epistemic Linear-Time Temporal Logic
- The Metamathematics of Infinitary Set Theoretical Systems
- Complexity of Scott sentences
- Spectral spaces of countable abelian lattice-ordered groups
This page was built for publication: Barwise: Infinitary Logic and Admissible Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4678932)