Sciweavers

479 search results - page 18 / 96
» A quantified logic of evidence
Sort
View
ECCC
2006
41views more  ECCC 2006»
13 years 8 months ago
On a syntactic approximation to logics that capture complexity classes
We formulate a formal syntax of approximate formulas for the logic with counting quantifiers, SOLP, studied by us in [1], where we showed the following facts: (i) In the presence ...
Argimiro Arratia, Carlos E. Ortiz
LOGCOM
2002
124views more  LOGCOM 2002»
13 years 7 months ago
Modal Logics Between Propositional and First-order
One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if...
Melvin Fitting
CORR
2008
Springer
89views Education» more  CORR 2008»
13 years 8 months ago
Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three
We study the model checking problem, for fixed structures A, over positive equality-free first-order logic
Barnaby Martin
JSYML
2002
114views more  JSYML 2002»
13 years 7 months ago
Interpolation for First Order S5
An interpolation theorem holds for many standard modal logics, but first order S5 is a prominent example of a logic for which it fails. In this paper it is shown that a first orde...
Melvin Fitting
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 8 months ago
Canonical calculi with (n,k)-ary quantifiers
Propositional canonical Gentzen-type systems, introduced in [2], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
Arnon Avron, Anna Zamansky