Pure Logic with Branched Quantifiers

DOI10.1002/MALQ.19890350106MaRDI QIDQ3795664zbMATH OpenOpenAlexFDO

Authors Marcin Mostowski

Publication date 1989

Published in Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19890350106

zbMATH Keywords

branched quantifiersdecidabilityHenkin quantifierunprovability

Mathematics Subject Classification ID

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

Recommendations

• Publication:3475261
• Publication:3489978
• The decision problem for branching time logic
• scientific article; zbMATH DE number 1163949
• scientific article; zbMATH DE number 2084388

Cited in

(7)

• Decidability problems in languages with Henkin quantifiers
• Degrees of logics with Henkin quantifiers in poor vocabularies
• Pure logic of many-many ground
• On the ontology of branching quantifiers
• scientific article; zbMATH DE number 4143963 (Why is no real title available?)
• scientific article; zbMATH DE number 1512848 (Why is no real title available?)
• PURE LOGIC OF ITERATED FULL GROUND

This page was built for publication: Pure Logic with Branched Quantifiers

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