Skip to content
Channels - Interactive Learning-Based Realizability for Heyting Arithmetic with EM1 :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Interactive Learning-Based Realizability for Heyting Arithmetic with EM1
Search for more channels:
Similar Items: Interactive Learning-Based Realizability for Heyting Arithmetic with EM1
Channel Options
View Record
Explore related channels
Quick Look
A new characterization of complete Heyting and co-Heyting algebras
Quick Look
Finitely generated free Heyting algebras via Birkhoff duality and coalgebra
Quick Look
Bounded Arithmetic in Free Logic
Quick Look
On the logical complexity of cyclic arithmetic
Quick Look
Logic for exact real arithmetic
Quick Look
Modular Path Queries with Arithmetic
Quick Look
Fusible numbers and Peano Arithmetic
Quick Look
Presburger Arithmetic with algebraic scalar multiplications
Quick Look
Intelligent EMS Dispatch via Adaptive Learning With Counterfactual and Risk-Aware Optimization
Quick Look
EM Design, Realization and Measurement of a Hexagonal SIW-Based Bandpass Filter for Wireless Communication
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
Stateful Realizers for Nonstandard Analysis
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 Sierpinski Object in the Scott Realizability Topos
Quick Look
From coinductive proofs to exact real arithmetic: theory and applications
Quick Look
Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic
Quick Look
Typed realizability for first-order classical analysis
Quick Look
Every metric space is separable in function realizability
Quick Look
On completeness and parametricity in the realizability semantics of System F
Quick Look
Realizability algebras: a program to well order R
Quick Look
Realizability algebras II : new models of ZF + DC
Load more items
View Record
Prev
Explore related channels
Next