Degrees of logics with Henkin quantifiers in poor vocabularies

DOI10.1007/s00153-004-0220-8zbMath1060.03062OpenAlexW2046368091MaRDI QIDQ1882566

Marcin Mostowski, Konrad Zdanowski

Publication date: 1 October 2004

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-004-0220-8

zbMATH Keywords

Henkin quantifiersdegrees of unsolvability

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Logic with extra quantifiers and operators (03C80) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

Computational complexity of the semantics of some natural language constructions

Cites Work

• Unnamed Item
• Decidability problems in languages with Henkin quantifiers
• On the semantics of the Henkin quantifier
• Pure Logic with Branched Quantifiers
• Finite partially-ordered quantification

This page was built for publication: Degrees of logics with Henkin quantifiers in poor vocabularies