Results 221 to 230 of about 114,330 (265)
Some of the next articles are maybe not open access.
2010
We introduce and study higher-order coalition logic, a multi modal monadic second-order logic with operators [{x}ψ]φ expressing that the coalition of all agents satisfying ψ(x) can achieve a state in which φ holds. We use neighborhood semantics to model extensive games of perfect information with simultaneous actions and
Guido Boella +3 more
openaire +1 more source
We introduce and study higher-order coalition logic, a multi modal monadic second-order logic with operators [{x}ψ]φ expressing that the coalition of all agents satisfying ψ(x) can achieve a state in which φ holds. We use neighborhood semantics to model extensive games of perfect information with simultaneous actions and
Guido Boella +3 more
openaire +1 more source
On connections and higher-order logic
Journal of Automated Reasoning, 1989Mathematics Technical ...
openaire +1 more source
Programming with Higher-Order Logic
2012Formal systems that describe computations over syntactic structures occur frequently in computer science. Logic programming provides a natural framework for encoding and animating such systems. However, these systems often embody variable binding, a notion that must be treated carefully at a computational level.
Miller, Dale, Gopalan, Nadathur
openaire +4 more sources
Hauptsatz for higher order logic
Journal of Symbolic Logic, 1968I shall prove in this paper that Gentzen's Hauptsatz is extendible to simple type theory, i.e., to the predicate logic obtained by admitting quantification over predicates of arbitrary finite type and generalizing the second order quantification rules to cover quantifiers of other types.
openaire +1 more source
On Higher-Order Description Logics. [PDF]
, 2009 We investigate an extension of Description Logics with higher-order capabilities, based on Henkin-style semantics. Our study starts from the observation that the various possibilities of adding higher-order constructs to a DL form a spectrum of increasing expressive power, including domain metamodeling, i.e., using concepts and roles as predicate ...
DE GIACOMO, Giuseppe +2 more
openaire +1 more source
Higher-Order Transformation of Logic Programs
2001It has earlier been assumed that a compositional approach to algorithm design and program transformation is somehow unique to functional programming. Elegant theoretical results codify the basic laws of algorithmics within the functional paradigm and with this paper we hope to demonstrate that some of the same techniques and results are applicable to ...
Silvija Seres, J. Michael Spivey
openaire +1 more source
1998
We now introduce the logical basis for program refinement, higher-order logic. This is an extension of the simply typed lambda calculus with logical connectives and quantifiers, permitting logical reasoning about functions in a very general way. In particular, it allows quantification over higher-order entities such as predicates and relations, a ...
Ralph-Johan Back, Joakim Wright
openaire +2 more sources
We now introduce the logical basis for program refinement, higher-order logic. This is an extension of the simply typed lambda calculus with logical connectives and quantifiers, permitting logical reasoning about functions in a very general way. In particular, it allows quantification over higher-order entities such as predicates and relations, a ...
Ralph-Johan Back, Joakim Wright
openaire +2 more sources
Connections and higher-order logic
1986Theorem proving is difficult and deals with complex phenomena. The difficulties seem to be compounded when one works with higher-order logic, but the rich expressive power of Church's formulation [10] [3] of this language makes research on theorem proving in this realm very worthwhile.
openaire +1 more source
1983
What is nowadays the central part of any introduction to logic, and indeed to some the logical theory par excellence, used to be a modest fragment of the more ambitious language employed in the logicist program of Frege and Russell. ‘Elementary’ or ‘first-order’, or ‘predicate logic’ only became a recognized stable base for logical theory by 1930, when
Johan Van Benthem, Kees Doets
openaire +1 more source
What is nowadays the central part of any introduction to logic, and indeed to some the logical theory par excellence, used to be a modest fragment of the more ambitious language employed in the logicist program of Frege and Russell. ‘Elementary’ or ‘first-order’, or ‘predicate logic’ only became a recognized stable base for logical theory by 1930, when
Johan Van Benthem, Kees Doets
openaire +1 more source