Decidability problems in languages with Henkin quantifiers

DOI10.1016/0168-0072(92)90003-IzbMath0764.03013OpenAlexW2072372034MaRDI QIDQ1198829

Marcin Mostowski, Michał Krynicki

Publication date: 16 January 1993

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(92)90003-i

zbMATH Keywords

Henkin quantifiersfunction quantifierstheory of equalityword problem for semigroups

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Logic with extra quantifiers and operators (03C80)

Related Items (3)

Degrees of logics with Henkin quantifiers in poor vocabularies ⋮ 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03 ⋮ 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Henkin and function quantifiers
• Model theory.
• On the semantics of the Henkin quantifier
• Pure Logic with Branched Quantifiers
• The Härtig quantifier: a survey
• The theory of abelian p-groups with the quantifier I is decidable
• Finite Partially‐Ordered Quantifiers
• Finite partially-ordered quantification

This page was built for publication: Decidability problems in languages with Henkin quantifiers