Results 1 to 10 of about 310 (69)
Realizability and Automatic Realizability of Galois Groups of Order 32
Central European Journal of Mathematics, 2010 Helen G. Grundman
exaly +2 more sources
Structural Properties of Connected Domination Critical Graphs
Mathematics, 2021 A graph G is said to be k-γc-critical if the connected domination number γc(G) is equal to k and γc(G+uv)
Norah Almalki, Pawaton Kaemawichanurat
doaj +1 more source
Stateful Realizers for Nonstandard Analysis [PDF]
Logical Methods in Computer Science, 2023 In this paper we propose a new approach to realizability interpretations for nonstandard arithmetic. We deal with nonstandard analysis in the context of (semi)intuitionistic realizability, focusing on the Lightstone-Robinson construction of a model for ...
Bruno Dinis, Étienne Miquey
doaj +1 more source
Interactive Learning-Based Realizability for Heyting Arithmetic with EM1 [PDF]
Logical Methods in Computer Science, 2010 We apply to the semantics of Arithmetic the idea of ``finite approximation'' used to provide computational interpretations of Herbrand's Theorem, and we interpret classical proofs as constructive proofs (with constructive rules for $\vee, \exists$) over ...
Federico Aschieri, Stefano Berardi
doaj +1 more source
A revised completeness result for the simply typed $\lambda\mu$-calculus using realizability semantics [PDF]
Logical Methods in Computer Science, 2017 In this paper, we define a new realizability semantics for the simply typed lambda-mu-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. We also prove a completeness result of our realizability semantics using a
Karim Nour, Mohamad Ziadeh
doaj +1 more source
A Local Logic for Realizability in Web Service Choreographies [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Web service choreographies specify conditions on observable interactions among the services. An important question in this regard is realizability: given a choreography C, does there exist a set of service implementations I that conform to C ?
R Ramanujam, S Sheerazuddin
doaj +1 more source
Interactive Realizability and the elimination of Skolem functions in Peano Arithmetic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We present a new syntactical proof that first-order Peano Arithmetic with Skolem axioms is conservative over Peano Arithmetic alone for arithmetical formulas.
Federico Aschieri, Margherita Zorzi
doaj +1 more source
Interpreting a Classical Geometric Proof with Interactive Realizability [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We show how to extract a monotonic learning algorithm from a classical proof of a geometric statement by interpreting the proof by means of interactive realizability, a realizability sematics for classical logic. The statement is about the existence of a
Giovanni Birolo
doaj +1 more source
Permutative universal realizability
Special Matrices, 2021 A list of complex numbers Λ is said to be realizable, if it is the spectrum of a nonnegative matrix. In this paper we provide a new sufficient condition for a given list Λ to be universally realizable (UR), that is, realizable for each possible Jordan ...
Soto Ricardo L. +2 more
doaj +1 more source
Every metric space is separable in function realizability [PDF]
Logical Methods in Computer Science, 2019 We first show that in the function realizability topos every metric space is separable, and every object with decidable equality is countable. More generally, working with synthetic topology, every $T_0$-space is separable and every discrete space is ...
Andrej Bauer, Andrew Swan
doaj +1 more source