Results 1  10
of
27
Explicit Provability And Constructive Semantics
 Bulletin of Symbolic Logic
, 2001
"... In 1933 G odel introduced a calculus of provability (also known as modal logic S4) and left open the question of its exact intended semantics. In this paper we give a solution to this problem. We find the logic LP of propositions and proofs and show that G odel's provability calculus is noth ..."
Abstract

Cited by 114 (22 self)
 Add to MetaCart
In 1933 G odel introduced a calculus of provability (also known as modal logic S4) and left open the question of its exact intended semantics. In this paper we give a solution to this problem. We find the logic LP of propositions and proofs and show that G odel's provability calculus is nothing but the forgetful projection of LP. This also achieves G odel's objective of defining intuitionistic propositional logic Int via classical proofs and provides a BrouwerHeytingKolmogorov style provability semantics for Int which resisted formalization since the early 1930s. LP may be regarded as a unified underlying structure for intuitionistic, modal logics, typed combinatory logic and #calculus.
Towards an Algebraic Semantics for the Object Paradigm
 In Hartmut Ehrig and Fernando Orejas, editors, Proceedings, Tenth Workshop on Abstract Data Types
, 1994
"... This paper surveys our current state of knowledge (and ignorance) on the use of hidden sorted algebra as a foundation for the object paradigm. Our main goal is to support equational reasoning about properties of concurrent systems of objects, because of its simple and ecient mechanisation. We sho ..."
Abstract

Cited by 86 (34 self)
 Add to MetaCart
This paper surveys our current state of knowledge (and ignorance) on the use of hidden sorted algebra as a foundation for the object paradigm. Our main goal is to support equational reasoning about properties of concurrent systems of objects, because of its simple and ecient mechanisation. We show how equational speci cations can describe objects, inheritance and modules; our treatment of the latter topic emphasises the importance of reuse, and the r^ole of the socalled Satisfaction Condition. We then consider how to prove things about objects, how to unify the object and logic paradigms by using logical variables that range over objects, and how to connect objects into concurrent systems.
Institution Morphisms
, 2001
"... Institutions formalize the intuitive notion of logical system, including syntax, semantics, and the relation of satisfaction between them. Our exposition emphasizes the natural way that institutions can support deduction on sentences, and inclusions of signatures, theories, etc.; it also introduces ..."
Abstract

Cited by 57 (17 self)
 Add to MetaCart
Institutions formalize the intuitive notion of logical system, including syntax, semantics, and the relation of satisfaction between them. Our exposition emphasizes the natural way that institutions can support deduction on sentences, and inclusions of signatures, theories, etc.; it also introduces terminology to clearly distinguish several levels of generality of the institution concept. A surprising number of different notions of morphism have been suggested for forming categories with institutions as objects, and an amazing variety of names have been proposed for them. One goal of this paper is to suggest a terminology that is uniform and informative to replace the current chaotic nomenclature; another goal is to investigate the properties and interrelations of these notions in a systematic way. Following brief expositions of indexed categories, diagram categories, twisted relations, and Kan extensions, we demonstrate and then exploit the duality between institution morphisms in the original sense of Goguen and Burstall, and the "plain maps" of Meseguer, obtaining simple uniform proofs of completeness and cocompleteness for both resulting categories. Because of this duality, we prefer the name "comorphism" over "plain map;" moreover, we argue that morphisms are more natural than comorphisms in many cases. We also consider "theoroidal" morphisms and comorphisms, which generalize signatures to theories, based on a theoroidal institution construction, finding that the "maps" of Meseguer are theoroidal comorphisms, while theoroidal morphisms are a new concept. We introduce "forward" and "seminatural" morphisms, and develop some of their properties. Appendices discuss institutions for partial algebra, a variant of order sorted algebra, two versions of hidden algebra, and...
The Coalgebraic Dual Of Birkhoff's Variety Theorem
, 2000
"... We prove an abstract dual of Birkho's variety theorem for categories E of coalgebras, given suitable assumptions on the underlying category E and suitable : E ## E . We also discuss covarieties closed under bisimulations and show that they are denable by a trivial kind of coequation { nam ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
We prove an abstract dual of Birkho's variety theorem for categories E of coalgebras, given suitable assumptions on the underlying category E and suitable : E ## E . We also discuss covarieties closed under bisimulations and show that they are denable by a trivial kind of coequation { namely, over one "color". We end with an example of a covariety which is not closed under bisimulations. This research is part of the Logic of Types and Computation project at Carnegie Mellon University under the direction of Dana Scott.
A Hidden Herbrand Theorem: Combining the Object and Logic Paradigms
 Principles of Declarative Programming
, 1998
"... : The benefits of the object, logic (or relational), functional, and constraint paradigms ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
: The benefits of the object, logic (or relational), functional, and constraint paradigms
Some Aspects of Model Theory and Finite Structures
, 2002
"... this paper is to highlight some of these aspects of the model theory of nite structures, where the nite and in nite interact fruitfully, in order to dispel the perhaps too common perception that ( rstorder) model theory has little to say about nite structures ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
this paper is to highlight some of these aspects of the model theory of nite structures, where the nite and in nite interact fruitfully, in order to dispel the perhaps too common perception that ( rstorder) model theory has little to say about nite structures
What is the Coalgebraic Analogue of Birkhoff's Variety Theorem?
 THEORETICAL COMPUTER SCIENCE
, 2000
"... Logical definability is investigated for certain classes of coalgebras related to statetransition systems, hidden algebras and Kripke models. The filter enlargement of a coalgebra A is introduced as a new coalgebra A + whose states are special "observationally rich" filters on the state s ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
Logical definability is investigated for certain classes of coalgebras related to statetransition systems, hidden algebras and Kripke models. The filter enlargement of a coalgebra A is introduced as a new coalgebra A + whose states are special "observationally rich" filters on the state set of A. The ultrafilter enlargement is the subcoalgebra A of A + whose states are ultrafilters. Boolean combinations of equations between terms of observable (or output) type are identified as a natural class of formulas for specifying properties of coalgebras. These observable formulas are permitted to have a single state variable, and form a language in which modalities describing the effects of state transitions are implicitly present. A and A + validate the same observable formulas. It is shown that a class of coalgebras is de nable by observable formulas iff the class is closed under disjoint unions, images of bisimulations, and (ultra) lter enlargements. (Closure under images of bisimulations is equivalent to closure under images and domains of coalgebraic morphisms.) Moreover, every set of observable formulas has the same models as some set of conditional equations. Examples are
Equational Logic of Polynomial Coalgebras
, 2001
"... Coalgebras of polynomial functors constructed from sets of observable elements have been found useful in modelling various kinds of data types and statetransition systems. This paper presents a calculus of terms for operations on such coalgebras, based on a simple type theory, and develops its ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Coalgebras of polynomial functors constructed from sets of observable elements have been found useful in modelling various kinds of data types and statetransition systems. This paper presents a calculus of terms for operations on such coalgebras, based on a simple type theory, and develops its semantics. The terms admit a single statevalued parameter, but may also have statevalued variables. In a "rigid" term all statevariables are bound. Boolean
Factorization systems and fibrations: Toward a fibred Birkhoff variety theorem
, 2002
"... It is wellknown that a factorization system on a category (with sufficient pullbacks) gives rise to a fibration. This paper characterizes the fibrations that arise in such a way, by making precise the logical structure that is given by factorization systems. The underlying motivation is to obtain g ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
It is wellknown that a factorization system on a category (with sufficient pullbacks) gives rise to a fibration. This paper characterizes the fibrations that arise in such a way, by making precise the logical structure that is given by factorization systems. The underlying motivation is to obtain general Birkho results in a fibred setting.