Results 31 to 40 of about 228,061 (236)
A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds [PDF]
, 2015 We study the problem of obtaining lower bounds for polynomial calculus (PC) and polynomial calculus resolution (PCR) on proof degree, and hence by [Impagliazzo et al. '99] also on proof size.
Mikša, Mladen, Nordström, Jakob
core +3 more sources
A strong call-by-need calculus [PDF]
Logical Methods in Computer Science, 2023 We present a call-by-need $\lambda$-calculus that enables strong reduction (that is, reduction inside the body of abstractions) and guarantees that arguments are only evaluated if needed and at most once.
Thibaut Balabonski +2 more
doaj +1 more source
Lietuvos Matematikos Rinkinys, 2013 We consider three sequent calculi for propositional linear temporal logic (PLTL) which allow us to formalize the properties of operator “always”. The main new results presented in the paper are: (1) introduction of the calculus with looping axioms; (2 ...
Romas Alonderis +1 more
doaj +1 more source
The call-by-value λµ∧∨-calculus [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In this paper, we introduce the $λ μ ^{∧∨}$ - call-by-value calculus and we give a proof of the Church-Rosser property of this system. This proof is an adaptation of that of Andou (2003) which uses an extended parallel reduction method and complete ...
Karim Nour, Khelifa Saber
doaj +1 more source
Proof Diagrams for Multiplicative Linear Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 The original idea of proof nets can be formulated by means of interaction nets syntax. Additional machinery as switching, jumps and graph connectivity is needed in order to ensure correspondence between a proof structure and a correct proof in sequent ...
Matteo Acclavio
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
Integrating a Global Induction Mechanism into a Sequent Calculus
, 2017 Most interesting proofs in mathematics contain an inductive argument which requires an extension of the LK-calculus to formalize. The most commonly used calculi for induction contain a separate rule or axiom which reduces the valid proof theoretic ...
C Dunchev +19 more
core +1 more source
A Labelled Sequent Calculus for BBI: Proof Theory and Proof Search
, 2015 We present a labelled sequent calculus for Boolean BI, a classical variant of O'Hearn and Pym's logic of Bunched Implication. The calculus is simple, sound, complete, and enjoys cut-elimination.
Gore, Rajeev, Hou, Zhe, Tiu, Alwen
core +1 more source
A sequent calculus for a semi-associative law [PDF]
Logical Methods in Computer Science, 2019 We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a semi-associative law ...
Noam Zeilberger
doaj +1 more source
A new graphical calculus of proofs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 We offer a simple graphical representation for proofs of intuitionistic logic, which is inspired by proof nets and interaction nets (two formalisms originating in linear logic).
Sandra Alves +2 more
doaj +1 more source