Results 1  10
of
12
Semantical considerations on FloydHoare Logic
, 1976
"... This paper deals with logics of programs. The objective is to formalize a notion of program description, and to give both plausible (semantic) and effective (syntactic) criteria for the notion of truth of a description. A novel feature of this treatment is the development of the mathematics underlyi ..."
Abstract

Cited by 212 (10 self)
 Add to MetaCart
This paper deals with logics of programs. The objective is to formalize a notion of program description, and to give both plausible (semantic) and effective (syntactic) criteria for the notion of truth of a description. A novel feature of this treatment is the development of the mathematics underlying FloydHoare axiom systems independently of such systems. Other directions that such research might take are considered.
Higher Order Logic
 In Handbook of Logic in Artificial Intelligence and Logic Programming
, 1994
"... Contents 1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 2 The expressive power of second order Logic : : : : : : : : : : : 3 2.1 The language of second order logic : : : : : : : : : : : : : 3 2.2 Expressing size : : : : : : : : : : : : : : : : : : : : : : : : 4 2.3 Definin ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
Contents 1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 2 The expressive power of second order Logic : : : : : : : : : : : 3 2.1 The language of second order logic : : : : : : : : : : : : : 3 2.2 Expressing size : : : : : : : : : : : : : : : : : : : : : : : : 4 2.3 Defining data types : : : : : : : : : : : : : : : : : : : : : 6 2.4 Describing processes : : : : : : : : : : : : : : : : : : : : : 8 2.5 Expressing convergence using second order validity : : : : : : : : : : : : : : : : : : : : : : : : : 9 2.6 Truth definitions: the analytical hierarchy : : : : : : : : 10 2.7 Inductive definitions : : : : : : : : : : : : : : : : : : : : : 13 3 Canonical semantics of higher order logic : : : : : : : : : : : : 15 3.1 Tarskian semantics of second order logic : : : : : : : : : 15 3.2 Function and re
A zeroone law for logic with a fixedpoint operator
 Inform. and Control
"... The logic obtained by adding the leastfixedpoint operator to firstorder logic was proposed as a query language by Aho and Ullman (in "Proc. 6th ACM Sympos. on Principles of Programming Languages, " 1979, pp. 110120) and has been studied, particularly in connection with finite models, by numerous ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
The logic obtained by adding the leastfixedpoint operator to firstorder logic was proposed as a query language by Aho and Ullman (in "Proc. 6th ACM Sympos. on Principles of Programming Languages, " 1979, pp. 110120) and has been studied, particularly in connection with finite models, by numerous authors. We extend to this logic, and to the logic containing the more powerful iterativefixedpoint operator, the zeroone law proved for firstorder logic in (Glebskii, Kogan, Liogonki, and Talanov (1969), Kibernetika 2, 3142; Fagin (1976), J. Symbolic Logic 41, 5058). For any sentence q ~ of the extended logic, the proportion of models of q ~ among all structures with universe {1, 2,..., n} approaches 0 or 1 as n tends to infinity. We also show that the problem of deciding, for any cp, whether this proportion approaches 1 is complete for exponential time, if we consider only q)'s with a fixed finite vocabulary (or vocabularies of bounded arity) and complete for doubleexponential time if ~0 is unrestricted. In addition, we establish some related results. © 1985 Academic Press, Inc.
On Modal µCalculus and NonWellFounded Set Theory
"... A finitary characterization for nonwellfounded sets with finite transitive closure is established in terms of modal µcalculus. This result generalizes the standard approach in the literature where a finitary characterization is only provided for wellfounded sets with finite transitive closure ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A finitary characterization for nonwellfounded sets with finite transitive closure is established in terms of modal µcalculus. This result generalizes the standard approach in the literature where a finitary characterization is only provided for wellfounded sets with finite transitive closure. The proof relies on the concept of automaton, leading then to new interlinks between automata theory and nonwellfounded sets.
The Modal µCalculus Hierarchy over Restricted Classes of Transition Systems
, 2008
"... We study the strictness of the modal µcalculus hierarchy over some restricted classes of transition systems. First, we show that the hierarchy is strict over reflexive frames. By proving the finite model theorem for reflexive systems the same results holds for finite models. Second, we prove that o ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We study the strictness of the modal µcalculus hierarchy over some restricted classes of transition systems. First, we show that the hierarchy is strict over reflexive frames. By proving the finite model theorem for reflexive systems the same results holds for finite models. Second, we prove that over transitive systems the hierarchy collapses to the alternationfree fragment. In order to do this the finite model theorem for transitive transition systems is also proved. Further, we verify that if symmetry is added to transitivity the hierarchy collapses to the purely modal fragment.
Sequent Calculi for the Modal µCalculus over S5
, 2008
"... We present two sequent calculi for the modal µcalculus over S5 and prove their completeness by using classical methods. One sequent calculus has an analytical cut rule and could be used for a decision procedure the other uses a modified version of the induction rule. We also provide a completeness ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present two sequent calculi for the modal µcalculus over S5 and prove their completeness by using classical methods. One sequent calculus has an analytical cut rule and could be used for a decision procedure the other uses a modified version of the induction rule. We also provide a completeness theorem for Kozen’s Axiomatisation over S5 without using the completeness result established by Walukiewicz for the modal µcalculus over arbitrary models.
Acknowledgments
, 2000
"... this report were made possible mainly with the financial support of the Ford Foundation. Additional contributions were received from Cosmetics Oriflame Romania and the Open Society Institute. We owe much to John Robbins, who conceived and developed the idea of this project. We thank the following ..."
Abstract
 Add to MetaCart
this report were made possible mainly with the financial support of the Ford Foundation. Additional contributions were received from Cosmetics Oriflame Romania and the Open Society Institute. We owe much to John Robbins, who conceived and developed the idea of this project. We thank the following for their contributions, support and assistance: The main implementers of the project: Renate Weber, Nicole Watson, Roxana Tesiu, Gulhan Borubaeva, Aurelija Kuzmaite, Tanya Lokshina, Genoveva Tisheva, and all the local rapporteurs and host NGOs; IHF staff who provided editorial and administrative assistance: Brigitte Dufour, Paula TscherneLempi inen, Ursula Lindenberg, Joachim Frank, Maria Kolb, Natalia Lazareva, Rainer Tannenberger, Judith Vitt and David Theil; Friends in the diplomatic, foundation, and civil society community and others who helped: Irena Gross, Sylvia Hordosch, Evelyn Watson, Milos UvericKostic, Agnes Horvthov, Liz Bonkow
On Modal µCalculus and GödelLöb Logic
"... Abstract. We show that the modal µcalculus over GL collapses to the modal fragment by showing that the fixpoint formula is reached after two iterations and answer to a question posed by van Benthem in [vBe06]. Further, we introduce the modal µ ∼calculus by allowing fixpoint constructors for any fo ..."
Abstract
 Add to MetaCart
Abstract. We show that the modal µcalculus over GL collapses to the modal fragment by showing that the fixpoint formula is reached after two iterations and answer to a question posed by van Benthem in [vBe06]. Further, we introduce the modal µ ∼calculus by allowing fixpoint constructors for any formula where the fixpoint variable appears guarded but not necessarily positive and show that this calculus over GL collapses to the modal fragment, too. The latter result allows us a new proof of the de Jongh, Sambin Theorem and provides a simple algorithm to construct the fixpoint formula. Keywords: Fixpoint, Modal µCalculus, GödelLöb Logic. 1
Games for Learning A Sabotage Approach
, 2009
"... In formal approaches to inductive learning, the ability to learn is understood as the ability to single out a correct hypothesis from a range of possibilities. Although most of the existing research focuses on the characteristics of the learner, in many paradigms the significance of the teacher’s ab ..."
Abstract
 Add to MetaCart
In formal approaches to inductive learning, the ability to learn is understood as the ability to single out a correct hypothesis from a range of possibilities. Although most of the existing research focuses on the characteristics of the learner, in many paradigms the significance of the teacher’s abilities and strategies is in fact undeniable. Motivated by this observation, in this paper we highlight the interactive nature of learning by proposing a gametheoretical and logical approach. We consider learning as a sabotagetype game between Teacher and Learner, and present different variants based on the level of cooperativeness and the actions available to the players. We characterize the existence of a winning strategy in such games by formulas of Sabotage Modal Logic, analyzing also their complexity. Our work constitutes the first step towards a unified gametheoretical and logical approach to formal learning theory. 1
A Syntactical Treatment of Simultaneous Fixpoints in the Modal µCalculus
, 2007
"... We provide a purely syntactical treatment of simultaneous fixpoints in the modal µcalculus by proving directly in Kozen’s axiomatisation their properties as greatest and least fixpoints, that is, the fixpoint axiom and the induction rule. Further, we apply our result in order to get a completeness ..."
Abstract
 Add to MetaCart
We provide a purely syntactical treatment of simultaneous fixpoints in the modal µcalculus by proving directly in Kozen’s axiomatisation their properties as greatest and least fixpoints, that is, the fixpoint axiom and the induction rule. Further, we apply our result in order to get a completeness result for characteristic formulae of finite pointed transition systems. Keywords: Modal µcalculus, proof theory, Kozen’s axiomatisation, simultaneous fixpoints