Barwise: Infinitary Logic and Admissible Sets

DOI10.2178/bsl/1080330272zbMath1080.03026OpenAlexW2062229169MaRDI QIDQ4678932

H. Jerome Keisler, Julia F. Knight

Publication date: 24 May 2005

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3555a5d1e3744df9a9ecdd2ef594ec67c08bf30d

zbMATH Keywords

admissible setinfinitary logicBarwise compactness

Mathematics Subject Classification ID

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)

Related Items (6)

Can logic be combined with probability? Probably ⋮ Complexity of Scott sentences ⋮ Spectral spaces of countable Abelian lattice-ordered groups ⋮ Bounds on the strength of ordinal definable determinacy in small admissible sets ⋮ INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES ⋮ Embedding Linear-Time Temporal Logic into Infinitary Logic: Application to Cut-Elimination for Multi-agent Infinitary Epistemic Linear-Time Temporal Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Computable structures and the hyperarithmetical hierarchy
• On the partial recursive functions of ordinal numbers
• Lefschetz's principle
• Hanf numbers for fragments of L\(_{\infty \omega}\)
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• On ω-consistency and related properties
• A generalization of the concept ofω-completeness
• An example concerning Scott heights
• Scott sentences and admissible sets
• An introduction to recursively saturated and resplendent models
• On Moschovakis closure ordinals
• Stationary logic
• A guide to the identification of admissible sets above structures
• Models with compactness properties relative to an admissible language
• Global inductive definability
• Toward model theory through recursive saturation
• Interpolation, preservation, and pebble games
• The Hanf number of second order logic
• Metarecursively enumerable sets and admissible ordinals
• Metarecursive sets
• A hierarchy of formulas in set theory
• Infinitary logic and admissible sets
• Applications of Strict Π₁¹ predicates to infinitary logic
• Infinitary properties of abelian torsion groups
• Persistent and invariant formulas relative to theories of higher order
• The next admissible set
• The completeness of the first-order functional calculus
• A generalization of the concept of ω-consistency

This page was built for publication: Barwise: Infinitary Logic and Admissible Sets