Skip to content
Channels - Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic
Search for more channels:
Similar Items: Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic
Channel Options
View Record
Explore related channels
Quick Look
Bounded Arithmetic in Free Logic
Quick Look
On the logical complexity of cyclic arithmetic
Quick Look
Bounded variation and the strength of Helly's selection theorem
Quick Look
The logical strength of Büchi's decidability theorem
Quick Look
Coinductive Formal Reasoning in Exact Real Arithmetic
Quick Look
Logic for exact real arithmetic
Quick Look
Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD
Quick Look
Preservation and decomposition theorems for bounded degree structures
Quick Look
The parameterized space complexity of model-checking bounded variable first-order logic
Quick Look
From coinductive proofs to exact real arithmetic: theory and applications
Quick Look
Lindstrom theorems for fragments of first-order logic
Quick Look
Formal Theories for Linear Algebra
Quick Look
The Formal Theory of Monads, Univalently
Quick Look
A Theory of Formal Choreographic Languages
Quick Look
Bounded Linear Logic, Revisited
Quick Look
Consistency of circuit lower bounds with bounded theories
Quick Look
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
Quick Look
Some observations on the logical foundations of inductive theorem proving
Quick Look
On the Nielsen-Schreier Theorem in Homotopy Type Theory
Quick Look
An Analysis of Tennenbaum's Theorem in Constructive Type Theory
Quick Look
A full formal representation of Arrow’s impossibility theorem
Quick Look
Theorem proving for prenex Gödel logic with Delta: checking validity and unsatisfiability
Quick Look
Weighted Logics for Nested Words and Algebraic Formal Power Series
Quick Look
On the strength of proof-irrelevant type theories
Load more items
View Record
Prev
Explore related channels
Next