Barwise: Infinitary Logic and Admissible Sets
From MaRDI portal
Publication:4678932
Recommendations
Cites work
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A generalization of the concept of ω-consistency
- A generalization of the concept ofω-completeness
- A guide to the identification of admissible sets above structures
- A hierarchy of formulas in set theory
- An example concerning Scott heights
- An introduction to recursively saturated and resplendent models
- Applications of Strict Π11 predicates to infinitary logic
- Computable structures and the hyperarithmetical hierarchy
- Global inductive definability
- Hanf numbers for fragments of L\(_{\infty \omega}\)
- Infinitary logic and admissible sets
- Infinitary properties of abelian torsion groups
- Interpolation, preservation, and pebble games
- Kreiseliana: about and around Georg Kreisel
- Lefschetz's principle
- Metarecursive sets
- Metarecursively enumerable sets and admissible ordinals
- Models with compactness properties relative to an admissible language
- On ω-consistency and related properties
- On Moschovakis closure ordinals
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
- On the partial recursive functions of ordinal numbers
- Persistent and invariant formulas relative to theories of higher order
- Scott sentences and admissible sets
- Stationary logic
- The Hanf number of second order logic
- The completeness of the first-order functional calculus
- The next admissible set
- Toward model theory through recursive saturation
Cited in
(10)- On certain fundamental problems of mathematical logic
- INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES
- scientific article; zbMATH DE number 3878917 (Why is no real title available?)
- 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)