Results 1 to 10 of about 1,309,863 (280)
A Probabilistic Higher-order Fixpoint Logic [PDF]
We introduce PHFL, a probabilistic extension of higher-order fixpoint logic, which can also be regarded as a higher-order extension of probabilistic temporal logics such as PCTL and the $\mu^p$-calculus. We show that PHFL is strictly more expressive than
Yo Mitani +2 more
doaj +7 more sources
The Complexity of Model Checking Higher-Order Fixpoint Logic [PDF]
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed \lambda-calculus and the modal \lambda-calculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of programs that ...
Roland Axelsson +2 more
doaj +4 more sources
Indexed linear logic and higher-order model checking [PDF]
In recent work, Kobayashi observed that the acceptance by an alternating tree automaton A of an infinite tree T generated by a higher-order recursion scheme G may be formulated as the typability of the recursion scheme G in an appropriate intersection ...
Charles Grellois, Paul-André Melliès
doaj +4 more sources
Equivalence of two Fixed-Point Semantics for Definitional Higher-Order Logic Programs [PDF]
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
Angelos Charalambidis +2 more
doaj +4 more sources
Language and Proofs for Higher-Order SMT (Work in Progress) [PDF]
Satisfiability modulo theories (SMT) solvers have throughout the years been able to cope with increasingly expressive formulas, from ground logics to full first-order logic modulo theories.
Haniel Barbosa +4 more
doaj +12 more sources
A relational logic for higher-order programs [PDF]
Relational program verification is a variant of program verification where one can reason about two programs and as a special case about two executions of a single program on different inputs. Relational program verification can be used for reasoning about a broad range of properties, including equivalence and refinement, and specialized notions such ...
ALEJANDRO AGUIRRE +4 more
openaire +6 more sources
Systematic Verification of the Modal Logic Cube in Isabelle/HOL [PDF]
We present an automated verification of the well-known modal logic cube in Isabelle/HOL, in which we prove the inclusion relations between the cube's logics using automated reasoning tools. Prior work addresses this problem but without restriction to the
Christoph Benzmüller +2 more
doaj +6 more sources
First steps in synthetic guarded domain theory: step-indexing in the topos of trees [PDF]
We present the topos S of trees as a model of guarded recursion. We study the internal dependently-typed higher-order logic of S and show that S models two modal operators, on predicates and types, which serve as guards in recursive definitions of terms,
Lars Birkedal +3 more
doaj +10 more sources
Superposition for Lambda-Free Higher-Order Logic [PDF]
We introduce refutationally complete superposition calculi for intentional and extensional clausal $\lambda$-free higher-order logic, two formalisms that allow partial application and applied variables.
Alexander Bentkamp +3 more
doaj +1 more source
The Frege-Geach Problem and the Logic of Higher-Order Attitudes [PDF]
Moral expressivism suggests that 1) moral sentences lack truth conditions and 2) our purpose in asserting moral sentences is to express non-cognitive attitudes such as desires, approval, or disapproval.
Bahram Alizade
doaj +1 more source

