Results 1 to 10 of about 63,358 (127)
A Logic for True Concurrency [PDF]
, 2014 We propose a logic for true concurrency whose formulae predicate about events in computations and their causal dependencies. The induced logical equivalence is hereditary history preserving bisimilarity, and fragments of the logic can be identified which
Baldan, Paolo, Crafa, Silvia
core +1 more source
A Potpourri of Reason Maintenance Methods [PDF]
, 2011 We present novel methods to compute changes to materialized views in logic databases like those used by rule-based reasoners. Such reasoners have to address the problem of changing axioms in the presence of materializations of derived atoms.
Bry, François +2 more
core +1 more source
The Epsilon Calculus and Herbrand Complexity [PDF]
, 2005 Hilbert's epsilon-calculus is based on an extension of the language of predicate logic by a term-forming operator $\epsilon_{x}$. Two fundamental results about the epsilon-calculus, the first and second epsilon theorem, play a role similar to that which ...
A. Blass +20 more
core +2 more sources
Automated verification of shape, size and bag properties. [PDF]
, 2007 In recent years, separation logic has emerged as a contender for formal reasoning of heap-manipulating imperative programs. Recent works have focused on specialised provers that are mostly based on fixed sets of predicates.
Alaoui-Ismaïli O. +7 more
core +3 more sources
, 2017 The Knower paradox purports to place surprising a priori limitations on what we can know. According to orthodoxy, it shows that we need to abandon one of three plausible and widely-held ideas: that knowledge is factive, that we can know that knowledge is
Jerzak, Ethan
core +1 more source
Order-Invariant MSO is Stronger than Counting MSO in the Finite [PDF]
, 2008 We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), extends MSO with first-order modulo-counting quantifiers, allowing the ...
Ganzow, Tobias, Rubin, Sasha
core +4 more sources
Iterated reflection principles over full disquotational truth [PDF]
, 2017 Iterated reflection principles have been employed extensively to unfold epistemic commitments that are incurred by accepting a mathematical theory. Recently this has been applied to theories of truth.
Fischer, Martin +2 more
core +3 more sources
Kant on the Logical Form of Singular Judgments [PDF]
, 2014 At A71/B96–7 Kant explains that singular judgements are ‘special’ because they stand to the general ones as Einheit to Unendlichkeit. The reference to Einheit brings to mind the category of unity and hence raises a spectre of
Lu-Adler, Huaping
core +1 more source
Reasoning with Forest Logic Programs and f-hybrid Knowledge Bases [PDF]
, 2011 Open Answer Set Programming (OASP) is an undecidable framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasoning procedures exist.
Feier, Cristina, Heymans, Stijn
core +2 more sources
Definability of groups in $\aleph_0$-stable metric structures [PDF]
, 2009 We prove that in a continuous $\aleph_0$-stable theory every type-definable group is definable. The two main ingredients in the proof are: \begin{enumerate} \item Results concerning Morley ranks (i.e., Cantor-Bendixson ranks) from \cite{BenYaacov ...
Yaacov, Itaï Ben
core +2 more sources