BRICS Basic Research in Computer Science BRICS RSU. Kohlenbach: On the No-Counterexample Interpretation On the No-Counterexample Interpretation

Source URL: www.mathematik.tu-darmstadt.de

• Mathematical logic
• Logic
• Proof theory
• Computability theory
• Mathematics
• Constructivism
• Primitive recursive functional
• First-order logic
• Symbol
• Primitive recursive function
• Primitive recursive arithmetic
• Realizability

Infinite-State High-Level MSCs: Model-Checking and Realizability ⋆ Blaise Genest a,1 Anca Muscholl a Helmut Seidl b,2 Marc Zeitoun a,3 a LIAFA,

Source URL: www.labri.fr

Realizability models and implicit complexity

Source URL: www.tcs.ifi.lmu.de

Realizability Models G. Rosolini DISI, Universit`a di Genova MFPS Tutorial, New Orleans, 10 April 2007

Source URL: www.disi.unige.it

Intuitionistic Mathematics and Realizability in the Physical World Andrej Bauer University of Ljubljana January 18, 2012 Abstract

Source URL: math.andrej.com

• Constructivism
• Logic
• Mathematics
• Abstraction
• Realizability
• Intuitionistic logic
• Infinitesimal
• Interpretation
• BrouwerHeytingKolmogorov interpretation
• Intuitionism
• Calculus
• Negation

Realizability and Parametricty in Pure Type Systems Jean-Philippe Bernardy1 and Marc Lasson2 1 2

Source URL: publications.lib.chalmers.se

Aspects of Predicative Algebraic Set Theory II: Realizability Benno van den Berg & Ieke Moerdijk June 20, 2008 Dedicated to Jean-Yves Girard on the occasion of his 60th birthday

Source URL: staff.fnwi.uva.nl

Automata and Logics for Concurrent Systems: Realizability and Verification Habilitation Thesis Mémoire d’Habilitation à Diriger des Recherches submitted by

Source URL: www.lsv.ens-cachan.fr

• Computer science
• Finite-state machine
• Model checking
• Formal verification
• Nested word
• Formal methods
• Automata-based programming
• Automata theory
• Theoretical computer science
• Applied mathematics

Peter Johnstone University of Cambridge Hyland + Gleason = Herbrand Recently, Benno van den Berg introduced a new class of realizability toposes which he named “Herbrand realizability toposes”. They have various rema

Source URL: web.science.mq.edu.au

Submitted to Sci. Math. Japonicae 1 Limiting rst order realizability interpretation Masahiro Nakata and Susumu Hayashi

Source URL: www.shayashi.jp

• Theory of computation
• Computability theory
• Function
• Integral calculus
• Primitive recursive function
• Fundamental theorem of calculus
• Mathematics
• Mathematical analysis
• Functions and mappings