Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The decidable normal modal logics are not recursively enumerable

From MaRDI portal
Publication:1072542
Jump to:navigation, search

DOI10.1007/BF00249364zbMath0587.03015OpenAlexW2035811313MaRDI QIDQ1072542

M. J. Cresswell

Publication date: 1985

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00249364


zbMATH Keywords

recursive presentationsdecidable modal logics


Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Theory of numerations, effectively presented structures (03D45)







This page was built for publication: The decidable normal modal logics are not recursively enumerable

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1072542&oldid=13088093"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 00:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki