You are not currently logged in.
Access JSTOR through your library or other institution:
Monodic Packed Fragment with Equality Is Decidable
Studia Logica: An International Journal for Symbolic Logic
Vol. 72, No. 2, Many-Dimensional Logical Systems (Nov., 2002), pp. 185-197
Published by: Springer
Stable URL: http://www.jstor.org/stable/20016460
Page Count: 13
You can always find the topics here!Topics: Decidability, Logical theorems, Temporal logic, Model theory, Predicates, Signatures, Predicate logic, Mathematical constants, Cardinality, Mathematical functions
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
We prove decidability of satisfiability of sentences of the monodic packed fragment of first-order temporal logic with equality and connectives Until and Since, in models with various flows of time and domains of arbitrary cardinality. We also prove decidability over models with finite domains, over flows of time including the real order.
Studia Logica: An International Journal for Symbolic Logic © 2002 Springer