Results 261 to 270 of about 165,990,627 (290)
Some of the next articles are maybe not open access.
2019
Most languages follow some grammatical rules in order to convey ideas clearly. Mathematics written in English of course has to follow these rules. Moreover, the ideas have to obey logical rules to be meaningful.
openaire +1 more source
Most languages follow some grammatical rules in order to convey ideas clearly. Mathematics written in English of course has to follow these rules. Moreover, the ideas have to obey logical rules to be meaningful.
openaire +1 more source
Logic of Proofs for Bounded Arithmetic
2006The logic of proofs is known to be complete for the semantics of proofs in Peano Arithmetic PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the operations on proofs can be realized by feasible, that is PTIME-computable, functions. In particular we will show that the logic of proofs is complete for the
openaire +2 more sources
On Boolean Algebraic Structure of Proofs: Towards an Algebraic Semantics for the Logic of Proofs
Studia Logica, 2023Meghdad Ghari
exaly
2004
We describe a rather natural proof search algorithm for a certain fragment of higher order (simply typed) minimal logic. This fragment is determined by requiring that every higher order variable Y can only occur in a context \(Y \vec{x}\), where \(\vec{x}\) are distinct bound variables in the scope of the operator binding Y, and of opposite polarity ...
openaire +2 more sources
We describe a rather natural proof search algorithm for a certain fragment of higher order (simply typed) minimal logic. This fragment is determined by requiring that every higher order variable Y can only occur in a context \(Y \vec{x}\), where \(\vec{x}\) are distinct bound variables in the scope of the operator binding Y, and of opposite polarity ...
openaire +2 more sources
Provability logic with operations on proofs
1997We present a natural axiomatization for propositional logic with a modal operator for formal provability (Solovay, [6]) and labeled modalities for individual proofs with operations on them (Artemov, [2]). For this purpose, the language has to be extended by two new operations.
openaire +1 more source
Cyclic Proofs, Hypersequents, and Transitive Closure Logic
Lecture Notes in Computer Science, 2022Anupam Das
exaly
CryptHOL: Game-Based Proofs in Higher-Order Logic
Journal of Cryptology, 2020Andreas Lochbihler
exaly
A logical analysis of burdens of proof
2009The starting point of this article is the claim that logics for defeasible argumentation provide the means to logically characterise the difference between several kinds of proof burdens, but only if they are embedded in a dynamic setting that captures the various stages of a legal proceeding.
H. Prakken, SARTOR, GIOVANNI
openaire +3 more sources
Natural proofs for data structure manipulation in C using separation logic
ACM SIGPLAN Notices, 2014Xiaokang Qiu, P Madhusudan
exaly