Results 31 to 40 of about 454 (145)
An Axiomatic Account of Question Evocation: The Propositional Case
Axioms, 2016 An axiomatic system for question evocation in Classical Propositional Logic is proposed. Soundness and completeness of the system are proven.
Andrzej Wiśniewski
doaj +1 more source
Axiomatizing Maximal Progress and Discrete Time [PDF]
Logical Methods in Computer Science, 2021 Milner's complete proof system for observational congruence is crucially based on the possibility to equate $\tau$ divergent expressions to non-divergent ones by means of the axiom $recX. (\tau.X + E) = recX. \tau. E$.
Mario Bravetti
doaj +1 more source
A Functional (Monadic) Second-Order Theory of Infinite Trees [PDF]
Logical Methods in Computer Science, 2020 This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite trees. MSO on infinite trees is a rich system, and its decidability ("Rabin's Tree Theorem") is one of the most powerful known results concerning the ...
Anupam Das, Colin Riba
doaj +1 more source
Structured Operational Semantics for Graph Rewriting [PDF]
Scientific Annals of Computer Science, 2012 Process calculi and graph transformation systems provide models of reactive systems with labelled transition semantics (LTS). While the semantics for process calculi is compositional, this is not the case for graph transformation systems, in general ...
A. Dorman, T. Heindel, B. König
doaj +1 more source
Interactive Small-Step Algorithms I: Axiomatization [PDF]
Logical Methods in Computer Science, 2007 In earlier work, the Abstract State Machine Thesis -- that arbitrary algorithms are behaviorally equivalent to abstract state machines -- was established for several classes of algorithms, including ordinary, interactive, small-step algorithms.
Andreas Blass +3 more
doaj +1 more source
Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem [PDF]
Logical Methods in Computer Science, 2007 In earlier work, the Abstract State Machine Thesis -- that arbitrary algorithms are behaviorally equivalent to abstract state machines -- was established for several classes of algorithms, including ordinary, interactive, small-step algorithms.
Andreas Blass +3 more
doaj +1 more source
Discrete Integrals Based on Comonotonic Modularity
Axioms, 2013 It is known that several discrete integrals, including the Choquet and Sugeno integrals, as well as some of their generalizations, are comonotonically modular functions.
Jean-Luc Marichal, Miguel Couceiro
doaj +1 more source
Structured Operational Semantics for Graph Rewriting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Process calculi and graph transformation systems provide models of reactive systems with labelled transition semantics. While the semantics for process calculi is compositional, this is not the case for graph transformation systems, in general.
Andrei Dorman, Tobias Heindel
doaj +1 more source
Mario Pieri's axiomatization of geometry [PDF]
ریاضی و جامعهIn this paper, we discuss the method of the Italian mathematician, Mario Pieri, for axiomatization of geometry, which is based only on two undefined terms, point and motion.
Reza Rezavand
doaj +1 more source
, 2020 In previous chapters we discussed how secrecy can be quantified: we described information measures that map a prior to a real number reflecting the amount of threat to which the secret is subjected; and we introduced g-vulnerabilities as a rich family of such information measures that can capture a variety of significant operational scenarios ...
Alvim, M.S. +5 more
openaire +2 more sources