Filters
Burden of Proof
The article deals with the meaning and function of the burden of proof in civil proceeding. Author comments the different views on the burden of proof and the meaning of the objective and subjective burden of proof, the abs...
Law
- 2018 •
- D
Rok uplatnění
D - Stať ve sborníku
Composition of Deductions within the Propositions-As-Types Paradigm
paradigm is less suited for general proof theory because-unlike proof theory based on category theory-it emphasizes categorical proofs over hypothetical inferences. One.) Dag Prawitz on Proof...
Philosophy, History and Philosophy of science and technology
- 2020 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
From Iterative Algebras to Iterative Theories
The coalgebraic proof of the existence of a free iterative theory is given. The proof uses a concept of iterative algebras and is much simpler and more general than the original proof given by Calvin Elgot and his ...
BA - Obecná matematika
- 2004 •
- A
Rok uplatnění
A - Audiovizuální tvorba
On the proof complexity of the Nisan-Wigderson generator
We prove the consistency of a statement generalizing Razborov''s conjecture from proof complexity with the true universal theory in the language of Cook''s theory PV....
BA - Obecná matematika
- 2011 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Weak Theories and Essential Undecidability
Weak variants Q-, R, and R_0 of Robinson arithmetic, and the theory of concatenation TC, and essential udecidability proofs of those are discusses. A proof of self-reference theorem for the theory R_0 is given....
BA - Obecná matematika
- 2008 •
- D
Rok uplatnění
D - Stať ve sborníku
On the proof complexity of the Nisan-Wigderson generator based on a hard NP boolean AND coNP function
We prove the consistency of a statement generalizing Razborov's conjecture from proof complexity with the true universal theory in the language of Cook's theory PV....
BA - Obecná matematika
- 2011 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Fragment of Nonstandard Analysis with a Finitary Consistency Proof
We introduce a nonstandard arithmetic NQA-based on the theory developed by R minimization schema. A finitary consistency proof for NQA-formalizable in PRA is presented. We also show interesting facts about the strength of the ...
BA - Obecná matematika
- 2007 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
From feasible proofs to feasible computations
We study several situations where it is possible to extract a feasible computational information from a proof, either in a first-order theory or in a propositional proof system....
BA - Obecná matematika
- 2010 •
- D
Rok uplatnění
D - Stať ve sborníku
From Feasible Proofs to Feasible Computations
We study several situations where it is possible to extract a feasible computational information from a proof, either in a first-order theory or in a propositional proof system....
BA - Obecná matematika
- 2010 •
- D
Rok uplatnění
D - Stať ve sborníku
A new proof of Ajtai's completeness theorem for nonstandard finite structures
related to questions in complexity theory. In this paper we give a new proof in a model of arithmetic can be end-extended and expanded to a model of a given theory G if and only if a contradiction cannot be derived by a (p...
BA - Obecná matematika
- 2015 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
- 1 - 10 out of 49 468