Results 31 to 40 of about 2,593,900 (78)
Non-commutative propositional logic with short-circuited biconditional and NAND [PDF]
, 2022 Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is evaluated only if the first argument does not suffice to determine the value of the expression. In programming, short-circuit evaluation is widely
Papuc, D., Ponse, A.
core +2 more sources
On translating conditional statements into mathematical logic [PDF]
arXiv, 2022 In this paper, we highlight a profound difference between conditional statements in mathematical logic and natural languages. This difference exists even when the conditional statements are used in mathematical theorems.
arxiv
On SAT representations of XOR constraints [PDF]
, 2013 We study the representation of systems S of linear equations over the two-element field (aka xor- or parity-constraints) via conjunctive normal forms F (boolean clause-sets).
A. Urquhart +13 more
core +2 more sources
A Proof Strategy Language and Proof Script Generation for Isabelle/HOL
, 2017 We introduce a language, PSL, designed to capture high level proof strategies in Isabelle/HOL. Given a strategy and a proof obligation, PSL's runtime system generates and combines various tactics to explore a large search space with low memory usage ...
A Bundy +10 more
core +1 more source
Propositional logic with short-circuit evaluation: a non-commutative and a commutative variant [PDF]
, 2018 Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is evaluated only if the first argument does not suffice to determine the value of the expression.
Bergstra, Jan A. +2 more
core +1 more source
From truth to computability II [PDF]
, 2005 Computability logic is a formal theory of computational tasks and resources. Formulas in it represent interactive computational problems, and "truth" is understood as algorithmic solvability.
Blass +7 more
core +2 more sources
arXiv, 2023 I present a technical embedding of alternating-time temporal logic into stit theory.
arxiv
A new face of the branching recurrence of computability logic [PDF]
, 2011 This letter introduces a new, substantially simplified version of the branching recurrence operation of computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html), and proves its equivalence to the old, "canonical ...
Blass +15 more
core +2 more sources
Abstraction Logic: A New Foundation for (Computer) Mathematics [PDF]
arXiv, 2022 Abstraction logic is a new logic, serving as a foundation of mathematics. It combines features of both predicate logic and higher-order logic: abstraction logic can be viewed both as higher-order logic minus static types as well as predicate logic plus operators and variable binding.
arxiv
A Proof of Kamp's theorem [PDF]
Logical Methods in Computer Science, Volume 10, Issue 1 (February
18, 2014) lmcs:730, 2014 We provide a simple proof of Kamp's theorem.
arxiv +1 more source