Results 21 to 30 of about 779,559 (291)
The sequential functionals of type $(\iota \rightarrow \iota)^n \rightarrow \iota$ form a dcpo for all $n \in \Bbb N$ [PDF]
Logical Methods in Computer Science, 2018 We prove that the sequential functionals of some fixed types at type level 2, taking finite sequences of unary functions as arguments, do form a directed complete partial ordering.
Dag Normann
doaj +1 more source
Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language [PDF]
Logical Methods in Computer ScienceWe introduce an extension of first-order logic that comes equipped with additional predicates for reasoning about an abstract state. Sequents in the logic comprise a main formula together with pre- and postconditions in the style of Hoare logic, and the ...
Thomas Powell
doaj +1 more source
The prospects for mathematical logic in the twenty-first century [PDF]
, 2001 The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed ...
Alexander S. Kechris +4 more
core +3 more sources
Universal Horn Sentences and the Joint Embedding Property [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 The finite models of a universal sentence $\Phi$ in a finite relational signature are the age of a structure if and only if $\Phi$ has the joint embedding property. We prove that the computational problem whether a given universal sentence $\Phi$ has the
Manuel Bodirsky +2 more
doaj +1 more source
On the logical complexity of cyclic arithmetic [PDF]
Logical Methods in Computer Science, 2020 We study the logical complexity of proofs in cyclic arithmetic ($\mathsf{CA}$), as introduced in Simpson '17, in terms of quantifier alternations of formulae occurring. Writing $C\Sigma_n$ for (the logical consequences of) cyclic proofs containing only $\
Anupam Das
doaj +1 more source
On the system CL12 of computability logic [PDF]
Logical Methods in Computer Science, 2015 Computability logic (see http://www.csc.villanova.edu/~japaridz/CL/) is a long-term project for redeveloping logic on the basis of a constructive game semantics, with games seen as abstract models of interactive computational problems.
Giorgi Japaridze
doaj +1 more source
Clause Set Cycles and Induction [PDF]
Logical Methods in Computer Science, 2020 In this article we relate a family of methods for automated inductive theorem proving based on cycle detection in saturation-based provers to well-known theories of induction.
Stefan Hetzl, Jannik Vierling
doaj +1 more source
A Cubical Language for Bishop Sets [PDF]
Logical Methods in Computer Science, 2022 We present XTT, a version of Cartesian cubical type theory specialized for Bishop sets \`a la Coquand, in which every type enjoys a definitional version of the uniqueness of identity proofs.
Jonathan Sterling +2 more
doaj +1 more source
Modal meet-implication logic [PDF]
Logical Methods in Computer Science, 2022 We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame.
Jim de Groot, Dirk Pattinson
doaj +1 more source
Ordered Models of the Lambda Calculus [PDF]
Logical Methods in Computer Science, 2013 Answering a question by Honsell and Plotkin, we show that there are two equations between lambda terms, the so-called subtractive equations, consistent with lambda calculus but not simultaneously satisfied in any partially ordered model with bottom ...
Antonino Salibra, Alberto Carraro
doaj +1 more source