Recursive complexity of the Carnap first order modal logic C

DOI10.1002/MALQ.200410057MaRDI QIDQ3376542zbMATH OpenOpenAlexWikidataFDO

Authors Amélie Gheerbrant, Marcin Mostowski

Publication date 24 March 2006

Published in MLQ (Search for Journal in Brave)

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

zbMATH Keywords

alethic modalitiesCarnap modal logicdegrees of unsolvabilityfinite modelsfirst-order modal logicHenkin quantifiersrecursive complexity of modal logicsecond-order logictautology problem

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Model theory of finite structures (03C13) Logic with extra quantifiers and operators (03C80) Second- and higher-order model theory (03C85) Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30) Descriptive complexity and finite models (68Q19)

Recommendations

• The completeness of Carnap's predicate logic
• scientific article; zbMATH DE number 1761406
• NP trees and Carnap's modal logic
• Remarks on a Carnapian extension of S5
• Some modifications of Carnap's modal logic

Cited in

(2)

• Remarks on a Carnapian extension of S5
• The completeness of Carnap's predicate logic

This page was built for publication: Recursive complexity of the Carnap first order modal logic C

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