On Moschovakis closure ordinals
From MaRDI portal
Publication:4143287
DOI 10.2307/2272133</link>zbMath 0367.02021</link>OpenAlex W2132541147</link>MaRDI QID Q4143287</link>
Publication date: 1977
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2272133
Model theory (03C99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65)
Related Items (37)
Generalized quantifiers and pebble games on finite structures ⋮ Semantic Restrictions over Second-Order Logic ⋮ Canonization for two variables and puzzles on the square ⋮ How to define a linear order on finite models ⋮ Atom structures of cylindric algebras and relation algebras ⋮ Hierarchies in transitive closure logic, stratified Datalog and infinitary logic ⋮ Metafinite model theory ⋮ An Extension of the Ehrenfeucht-Fraïssé Game for First Order Logics Augmented with Lindström Quantifiers ⋮ The Kolmogorov expressive power of Boolean query languages ⋮ Integrity constraints for XML ⋮ Preservation theorems in finite model theory ⋮ The Modelwise Interpolation Property of Semantic Logics ⋮ Arboreal categories and equi-resource homomorphism preservation theorems ⋮ A uniform method for proving lower bounds on the computational complexity of logical theories ⋮ Parametrization over inductive relations of a bounded number of variables ⋮ Definability with bounded number of bound variables ⋮ When is arithmetic possible? ⋮ Pebble Games over Ordered Structural Abstractions ⋮ Computing on structures ⋮ On the expressive power of counting ⋮ Computing with infinitary logic ⋮ Implicit definability and infinitary logic in finite model theory ⋮ Infinitary logics and 0-1 laws ⋮ A restricted second order logic for finite structures ⋮ The axiom of elementary sets on the edge of Peircean expressibility ⋮ Metafinite model theory ⋮ LOGIC IN THE TRACTATUS ⋮ Barwise: Infinitary Logic and Admissible Sets ⋮ Large finite structures with few \(L^k\)-types ⋮ Infinitary logic for computer science ⋮ Reflective relational machines ⋮ A restricted second order logic for finite structures ⋮ On the power of built-in relations in certain classes of program schemes ⋮ Ordinal spectra of first-order theories ⋮ How many variables are needed to express an existential positive query? ⋮ Path constraints in semistructured databases ⋮ Topological queries in spatial databases
This page was built for publication: On Moschovakis closure ordinals
