Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Satisfiability vs. finite satisfiability in elementary modal logics

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

zbMATH Open1469.03051arXiv1210.2481MaRDI QIDQ4986511FDOQ4986511

Jakub Michaliszyn, Piotr Witkowski, Jan Otop

Publication date: 27 April 2021


Full work available at URL: https://arxiv.org/abs/1210.2481




Recommendations

  • Satisfiability versus Finite Satisfiability in Elementary Modal Logics
  • Decidable elementary modal logics
  • On the decidability of elementary modal logics
  • Elementary modal logics over transitive structures
  • Modal logics definable by universal three-variable formulas


Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)



Cited In (3)

  • Satisfiability versus Finite Satisfiability in Elementary Modal Logics
  • Title not available (Why is that?)
  • A case for satisfaction classes: model theoretic vs axiomatic approaches to the notion of truth





This page was built for publication: Satisfiability vs. finite satisfiability in elementary modal logics

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4986511&oldid=19437246"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 09:45. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki