Stationary logic of finitely determinate structures

DOI10.1016/0003-4843(79)90009-3zbMath0448.03025OpenAlexW2095271848MaRDI QIDQ3893909

Paul C. Eklof, Alan H. Mekler

Publication date: 1979

Published in: Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0003-4843(79)90009-3

zbMATH Keywords

algebraic systemsstationary logicfinitely determinate structureselementary chainselimination of quantifiers for modules

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Decidability of theories and sets of sentences (03B25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Logic with extra quantifiers and operators (03C80) Other infinitary logic (03C75) Abelian groups (20K99) Quantifier elimination, model completeness, and related topics (03C10)

Related Items

Some contributions to definability theory for languages with generalized quantifiers ⋮ Remarks in abstract model theory ⋮ \(\text{PA} (aa)\) ⋮ Automorphism properties of stationary logic ⋮ Stationary Logic and Ordinals ⋮ Undecidable Theories in Stationary Logic ⋮ Classification theory through stationary logic ⋮ Elementary pairs of models ⋮ Obituary: Alan Mekler ⋮ Set theory with a filter quantifier ⋮ Stationary logic of ordinals