Enhancing fixed point logic with cardinality quantifiers

DOI10.1093/LOGCOM/8.1.71MaRDI QIDQ4399514zbMATH OpenOpenAlexFDO

Authors Lauri Hella, H. Imhof

Publication date 28 July 1998

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL http://doc.rero.ch/record/292194/files/8-1-71.pdf

zbMATH Keywords

cardinal quantifiersdescriptive complexity theoryfinite model theoryfixed point logicsgeneralized quantifiers

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Logic with extra quantifiers and operators (03C80) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Compactness in logic with cardinality quantifiers
• scientific article; zbMATH DE number 1043779
• The expressive power of fixed-point logic with counting
• Fixed-point logics, generalized quantifiers, and oracles
• Fixed-point extensions of first-order logic
• Pushing the boundaries of reasoning about qualified cardinality restrictions
• scientific article; zbMATH DE number 4170882
• On fixed-point logic with counting
• Expressing cardinality quantifiers in monadic second-order logic over chains
• Fixed Point Logics

Cited in

(3)

• Cardinality logics. Part II: Definability in languages based on ‘exactly’
• Fixed-point logics, generalized quantifiers, and oracles
• Quantifiers closed under partial polymorphisms

This page was built for publication: Enhancing fixed point logic with cardinality quantifiers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4399514)