Results 21 to 30 of about 65,097 (137)
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
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
Equivalence of two Fixed-Point Semantics for Definitional Higher-Order Logic Programs
, 2015 Two distinct research approaches have been proposed for assigning a purely extensional semantics to higher-order logic programming. The former approach uses classical domain theoretic tools while the latter builds on a fixed-point construction defined on
Charalambidis, Angelos +2 more
core +4 more sources
On Automated Lemma Generation for Separation Logic with Inductive Definitions [PDF]
, 2015 Separation Logic with inductive definitions is a well-known approach for deductive verification of programs that manipulate dynamic data structures. Deciding verification conditions in this context is usually based on user-provided lemmas relating the ...
B Cook +14 more
core +4 more sources
, 2017 Halbach has argued that Tarski biconditionals are not ontologically conservative over classical logic, but his argument is undermined by the fact that he cannot include a theory of arithmetic, which functions as a theory of syntax.
Heylen, Jan, Horsten, Leon
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
Quantification in frame semantics with binders and nominals of hybrid logic
Journal of Language Modelling, 2017 This paper aims to integrate logical operators into frame-based semantics. Frames are semantic graphs that allow lexical meaning to be captured in a fine-grained way but that do not come with a natural way to integrate logical operators such as ...
Laura Kallmeyer +2 more
doaj +1 more source
Deontic Logics as Axiomatic Extensions of First-Order Predicate Logic: An Approach Inspired by Wolniewicz’s Formal Ontology of Situations [PDF]
Axioms, 2019 The aim of this article is to present a method of creating deontic logics as axiomatic theories built on first-order predicate logic with identity. In the article, these theories are constructed as theories of legal events or as theories of acts. Legal events are understood as sequences (strings) of elementary situations in Wolniewicz′s sense.
openaire +2 more sources
Refinement Calculus of Reactive Systems
, 2014 Refinement calculus is a powerful and expressive tool for reasoning about sequential programs in a compositional manner. In this paper we present an extension of refinement calculus for reactive systems.
Preoteasa, Viorel, Tripakis, Stavros
core +1 more source