Sciweavers

551 search results - page 7 / 111
» Natural proofs
Sort
View
IANDC
2007
133views more  IANDC 2007»
13 years 9 months ago
On decidability of monadic logic of order over the naturals extended by monadic predicates
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
Alexander Rabinovich
ECCC
2006
88views more  ECCC 2006»
13 years 9 months ago
On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge
Abstract. This article points out a gap between two natural formulations of the concept of a proof of knowledge, and shows that in all natural cases (e.g., NP-statements) this gap ...
Mihir Bellare, Oded Goldreich
ASM
2010
ASM
14 years 6 months ago
Synchronous Message Passing and Semaphores: An Equivalence Proof
A natural encoding of synchronous message exchange with direct wait-control is proved to be equivalent in a distributed environment to a refinement which uses semaphores to implem...
Iain Craig, Egon Börger
JAR
2002
77views more  JAR 2002»
13 years 9 months ago
Proof Reflection in Coq
We formalise natural deduction for first-order logic in the proof assistant Coq, using De Bruijn indices for variable binding. The main judgement we model is of the form d [:] , ...
Dimitri Hendriks
CADE
2006
Springer
14 years 10 months ago
Automating Proofs in Category Theory
Abstract. We introduce a semi-automated proof system for basic category-theoretic reasoning. It is based on a first-order sequent calculus that captures the basic properties of cat...
Dexter Kozen, Christoph Kreitz, Eva Richter