Results 31 to 40 of about 101,814 (276)
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
Privileged Chiral Photocatalysts
Angewandte Chemie, EarlyView.Privileged chiral catalysts have transformed asymmetric synthesis, conferring generality to processes that are routinely leveraged in the construction of societally important functional small molecules. This mini‐review is intended to survey the conception and evolution of privileged chiral photocatalyst scaffolds that enable simultaneous orchestration
Emanuel Studer +3 more
wiley +2 more sources
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
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
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
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
Delimited control operators prove Double-negation Shift [PDF]
, 2011 We propose an extension of minimal intuitionistic predicate logic, based on delimited control operators, that can derive the predicate-logic version of the Double-negation Shift schema, while preserving the disjunction and existence ...
Ariola +31 more
core +6 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
Stone-Type Dualities for Separation Logics [PDF]
, 2019 Stone-type duality theorems, which relate algebraic and relational/topological models, are important tools in logic because -- in addition to elegant abstraction -- they strengthen soundness and completeness to a categorical equivalence, yielding a ...
Docherty, Simon, Pym, David
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