Results 241 to 250 of about 5,869 (280)
Classical Realizability in the CPS Target Language [PDF]
Electronic Notes in Theoretical Computer Science, 2016 Motivated by considerations about Krivine's classical realizability, we introduce a term calculus for an intuitionistic logic with record types, which we call the CPS target language.
Frey, Jonas
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Philosophical Logic, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Realization, Micro‐Realization, and Coincidence
Philosophy and Phenomenological Research, 2003Let thin properties be properties shared by coincident entities, e.g., a person and her body, and thick properties ones that are not shared. Thick properties entail sortal properties, e.g., being a person, and the associated persistence conditions. On the first account of realization defined here, the realized property and its realizers will belong to ...
openaire +1 more source
Variations on realizability: realizing the propositional axiom of choice
Mathematical Structures in Computer Science, 2002Realizability and related functional interpretations provide models for constructive mathematics. Generally, these models do not validate the axiom of choice for propositions taken over hierarchies of extensional functionals. We describe simple classes of models where the axiom is validated.
openaire +1 more source
2019
The aim of this paper is to address the question: when does a physical system realize (implement) a certain computation? The most developed account that answers this question is Piccinini’s mechanistic account. Our strategy is to start from Piccinini’s reflections, emphasizing different aspects of the problem of realization and thus proposing a novel ...
VINCENZO FANO +3 more
openaire +2 more sources
The aim of this paper is to address the question: when does a physical system realize (implement) a certain computation? The most developed account that answers this question is Piccinini’s mechanistic account. Our strategy is to start from Piccinini’s reflections, emphasizing different aspects of the problem of realization and thus proposing a novel ...
VINCENZO FANO +3 more
openaire +2 more sources
2012
We present a new multi-valued monitoring approach for linear-time temporal logic that classifies trace prefixes not only according to the existence of correct and erroneous continuations, but also according to the strategic power of the system and its environment to avoid or enforce a violation of the specification.
Rüdiger Ehlers, Bernd Finkbeiner
openaire +2 more sources
We present a new multi-valued monitoring approach for linear-time temporal logic that classifies trace prefixes not only according to the existence of correct and erroneous continuations, but also according to the strategic power of the system and its environment to avoid or enforce a violation of the specification.
Rüdiger Ehlers, Bernd Finkbeiner
openaire +2 more sources
Journal of Symbolic Logic, 1990
AbstractV. Lifschitz defined in 1979 a variant of realizability which validates Church's thesis with uniqueness condition, but not the general form of Church's thesis. In this paper we describe an extension of intuitionistic arithmetic in which the soundness of Lifschitz' realizability can be proved, and we give an axiomatic characterization of the ...
openaire +1 more source
AbstractV. Lifschitz defined in 1979 a variant of realizability which validates Church's thesis with uniqueness condition, but not the general form of Church's thesis. In this paper we describe an extension of intuitionistic arithmetic in which the soundness of Lifschitz' realizability can be proved, and we give an axiomatic characterization of the ...
openaire +1 more source
Mathematical Systems Theory, 1972
Behavior is left adjoint to minimal realization, as functors between certain categories of machines and behaviors. This gives a succinct characterization of minimal realization valid for discrete as well as linear machines, with or without finiteness condition. Realization theory is therefore expressed in contemporary algebra in a way which reveals its
openaire +2 more sources
Behavior is left adjoint to minimal realization, as functors between certain categories of machines and behaviors. This gives a succinct characterization of minimal realization valid for discrete as well as linear machines, with or without finiteness condition. Realization theory is therefore expressed in contemporary algebra in a way which reveals its
openaire +2 more sources
Generalized Realizability and Basic Logic
ACM Transactions on Computational Logic, 2021Aleksandr Yu Konovalov
exaly
On realization and implementation
1981We give a fundamental notion of implementation of one algebraic data type by another one that gives a unifying framework for studying various recent approaches to algebraic implementation, and at the same time is consistent with the classical theory of finite automata realization developed by Hartmanis and Stearns.
openaire +1 more source