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

A completeness theorem for continuous predicate modal logic

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

DOI10.1007/S00153-018-0630-7zbMath1448.03012OpenAlexW2801429813MaRDI QIDQ1712937

Stefano Baratella

Publication date: 24 January 2019

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

Full work available at URL: http://link.springer.com/article/10.1007/s00153-017-0554-7


zbMATH Keywords

modal logicpredicate logiccontinuous logic


Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Many-valued logic (03B50)


Related Items (2)

UNDECIDABILITY AND NON-AXIOMATIZABILITY OF MODAL MANY-VALUED LOGICS ⋮ Continuous accessibility modal logics




Cites Work

  • Continuous first order logic and local stability
  • MANY-VALUED MODAL LOGICS: A SIMPLE APPROACH
  • Continuous propositional modal logic
  • A proof of completeness for continuous first-order logic
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: A completeness theorem for continuous predicate modal logic

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