Applications of Strict Π11 predicates to infinitary logic
From MaRDI portal
Publication:5619067
DOI10.2307/2270906zbMath0216.00305OpenAlexW2256908423MaRDI QIDQ5619067
Publication date: 1969
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2270906
Related Items (10)
Boolean dependence logic and partially-ordered connectives ⋮ Automatic synthesis of logical models for order-sorted first-order theories ⋮ Descriptive characterizations of computational complexity ⋮ The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques ⋮ Barwise: Infinitary Logic and Admissible Sets ⋮ The Sylvester-Gallai theorem, colourings and algebra ⋮ Σ1-compactness in languages stronger than ⋮ On Some Semi-constructive Theories Related to Kripke–Platek Set Theory ⋮ Partially ordered connectives and monadic monotone strict NP ⋮ European Meeting of the Association for Symbolic Logic, Bristol, England, 1973
Cites Work
This page was built for publication: Applications of Strict Π11 predicates to infinitary logic