Results 21 to 30 of about 503 (185)
Infinitary Axiomatization of the Equational Theory of Context-Free Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We give a natural complete infinitary axiomatization of the equational theory of the context-free languages, answering a question of Leiß (1992).
Niels Bjørn Bugge Grathwohl +2 more
doaj +1 more source
The Journal of Symbolic Logic, 2022 AbstractFollowing the finitist’s rejection of the complete totality of the natural numbers, a finitist language allows only propositional connectives and bounded quantifiers in the formula-construction but not unbounded quantifiers. This is opposed to the currently standard framework, a first-order language.
Sato Kentaro, Jan Walker
openaire +1 more source
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
Privacy: An Axiomatic Approach
Entropy, 2022 The increasing prevalence of large-scale data collection in modern society represents a potential threat to individual privacy. Addressing this threat, for example through privacy-enhancing technologies (PETs), requires a rigorous definition of what exactly is being protected, that is, of privacy itself.
Alexander Ziller +4 more
openaire +4 more sources
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
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