Results 21 to 30 of about 16,441 (253)
The Complexity of Reasoning for Fragments of Default Logic [PDF]
Journal of Logic and Computation, 2009 Corrected ...
Olaf Beyersdorff +3 more
openaire +6 more sources
Algebraic logic for the negation fragment of classical logic
Logic Journal of the IGPL, 2023 Abstract The general aim of this article is to study the negation fragment of classical logic within the framework of contemporary (Abstract) Algebraic Logic. More precisely, we shall find the three classes of algebras that are canonically associated with a logic in Algebraic Logic, i.e. we find the classes $\textrm{Alg}^*$, $\textrm{Alg}
openaire +3 more sources
Fragmentation and logical omniscience [PDF]
Noûs, 2021 AbstractIt would be good to have a Bayesian decision theory that assesses our decisions and thinking according to everyday standards of rationality—standards that do not require logical omniscience (Garber, 1983; Hacking, 1967). To that end we develop a “fragmented” decision theory in which a single state of mind is represented by a family of credence ...
Adam Elga, Agustín Rayo
openaire +2 more sources
Finite Model Reasoning in Expressive Fragments of First-Order Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard translation of ...
Lidia Tendera
doaj +1 more source
Decidable fragments of many-sorted logic [PDF]
Journal of Symbolic Computation, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aharon Abadi +2 more
openaire +2 more sources
On two-variable guarded fragment logic with expressive local Presburger constraints [PDF]
Logical Methods in Computer ScienceWe consider the extension of the two-variable guarded fragment logic with local Presburger quantifiers. These are quantifiers that can express properties such as "the number of incoming blue edges plus twice the number of outgoing red edges is at ...
Chia-Hsuan Lu, Tony Tan
doaj +1 more source
Loop-free verification of termination of derivation for a fragment of dynamic logic
Lietuvos Matematikos Rinkinys, 2008 A fragment of a deterministic propositional dynamic logic (DPDL, in short) is considered The language of considered fragment contains propositional symbols, action constants, action operator (repetition) and logical symbols.
Regimantas Pliuškevičius
doaj +1 more source
Ultrafilters on words for a fragment of logic
Theoretical Computer Science, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gehrke, Mai +2 more
openaire +1 more source
On decidability of a fragment of intuitionistic predicate logic
Lietuvos Matematikos Rinkinys, 1999 There is not abstract.
Jolanta Kaušilaitė +1 more
doaj +3 more sources
A Probabilistic Temporal Logic with Frequency Operators and Its Model Checking [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Probabilistic Computation Tree Logic (PCTL) and Continuous Stochastic Logic (CSL) are often used to describe specifications of probabilistic properties for discrete time and continuous time, respectively.
Takashi Tomita +2 more
doaj +1 more source