Skip to content
<title>Channels - Bounded Arithmetic in Free Logic :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Bounded Arithmetic in Free Logic
Search for more channels:
Similar Items: Bounded Arithmetic in Free Logic
Channel Options
View Record
Explore related channels
Quick Look
Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic
Quick Look
On the logical complexity of cyclic arithmetic
Quick Look
Logic for exact real arithmetic
Quick Look
Bounded Linear Logic, Revisited
Quick Look
Modular Path Queries with Arithmetic
Quick Look
Fusible numbers and Peano Arithmetic
Quick Look
Presburger Arithmetic with algebraic scalar multiplications
Quick Look
Successor-Invariant First-Order Logic on Classes of Bounded Degree
Quick Look
Coinductive Formal Reasoning in Exact Real Arithmetic
Quick Look
Coalgebraic Satisfiability Checking for Arithmetic $mu$-Calculi
Quick Look
Decidability of extensions of Presburger arithmetic by generalised polynomials
Quick Look
Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic
Quick Look
Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
Quick Look
Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds
Quick Look
Type classes for efficient exact real arithmetic in Coq
Quick Look
On Presburger arithmetic extended with non-unary counting quantifiers
Quick Look
The parameterized space complexity of model-checking bounded variable first-order logic
Quick Look
Superposition for Lambda-Free Higher-Order Logic
Quick Look
Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic
Quick Look
Interactive Learning-Based Realizability for Heyting Arithmetic with EM1
Quick Look
From coinductive proofs to exact real arithmetic: theory and applications
Quick Look
A Complete Axiomatisation for Quantifier-Free Separation Logic
Quick Look
An Adaptive Parameter-free and Projection-free Restarting Level Set Method for Constrained Convex Optimization Under the Error Bound Condition
Quick Look
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
Load more items
View Record
Prev
Explore related channels
Next
