Results 31 to 40 of about 102,741 (269)
Cycle Detection in Computation Tree Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 Temporal logic is a very powerful formalism deeply investigated and used in formal system design and verification. Its application usually reduces to solving specific decision problems such as model checking and satisfiability. In these kind of problems,
Gaëlle Fontaine +4 more
doaj +1 more source
Rigid and Flexible Quantification in Plural Predicate Logic
, 2017 Noun phrases with overt determiners, such as some apples or a quantity of milk , differ from bare noun phrases like apples or milk in their contribution to aspectual composition.
Lucas Champollion +2 more
semanticscholar +1 more source
The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic
ACM Transactions on Computational Logic, 2021 The list segment predicate ls used in separation logic for verifying programs with pointers is well suited to express properties on singly-linked lists.
Stephane Demri +2 more
semanticscholar +1 more source
A Type-Directed Negation Elimination [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 In the modal mu-calculus, a formula is well-formed if each recursive variable occurs underneath an even number of negations. By means of De Morgan's laws, it is easy to transform any well-formed formula into an equivalent formula without negations ...
Etienne Lozes
doaj +1 more source
Superdeduction in Lambda-Bar-Mu-Mu-Tilde [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Superdeduction is a method specially designed to ease the use of first-order theories in predicate logic. The theory is used to enrich the deduction system with new deduction rules in a systematic, correct and complete way.
Clément Houtmann
doaj +1 more source
Embedding First-Order Tableaux into a Pure Type System [PDF]
, 1998 We consider Pure Type Systems (PTSs) extended with a mechanism for parametric terms. In this paper we introduce a PTS called λP— utilizing this extension. λP— exactly corresponds to first-order predicate logic, unlike the usual embedding of this logic in
Franssen, Michael
core +1 more source
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
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
, 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
Practical Theory Extension in Event-B [PDF]
, 2013 . The Rodin tool for Event-B supports formal modelling and proof using a mathematical language that is based on predicate logic and set theory. Although Rodin has in-built support for a rich set of operators and proof rules, for some application areas ...
Butler, Michael, Maamria, Issam
core +1 more source