Results 1 
4 of
4
Observational Ultraproducts of Polynomial Coalgebras
, 2002
"... Coalgebras of polynomial functors constructed from sets of observable elements have been found useful in modelling various kinds of data types and statetransition systems. ..."
Abstract

Cited by 6 (3 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.
A modal proof theory for final polynomial coalgebras. Theoret
 Comput. Sci
"... An infinitary proof theory is developed for modal logics whose models are coalgebras of polynomial functors on the category of sets. The canonical model method from modal logic is adapted to construct a final coalgebra for any polynomial functor. The states of this final coalgebra are certain “maxim ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
An infinitary proof theory is developed for modal logics whose models are coalgebras of polynomial functors on the category of sets. The canonical model method from modal logic is adapted to construct a final coalgebra for any polynomial functor. The states of this final coalgebra are certain “maximal ” sets of formulas that have natural syntactic closure properties. The syntax of these logics extends that of previously developed modal languages for polynomial coalgebras by adding formulas that express the “termination ” of certain functions induced by transition paths. A completeness theorem is proven for the logic of functors which have the Lindenbaum property that every consistent set of formulas has a maximal extension. This property is shown to hold if if the deducibility relation is generated by countably many inference rules. A counterexample to completeness is also given. This is a polynomial functor that is not Lindenbaum: it has an uncountable set of formulas that is deductively consistent but has no maximal extension and is unsatisfiable, even though all of its countable subsets are satisfiable. 1
Axiomatic Classes of Intuitionistic Models
"... A class of Kripke models for intuitionistic propositional logic is ‘axiomatic’ if it is the class of all models of some set of formulas (axioms). This paper discusses various structural characterisations of axiomatic classes in terms of closure under certain constructions, including images of bisim ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A class of Kripke models for intuitionistic propositional logic is ‘axiomatic’ if it is the class of all models of some set of formulas (axioms). This paper discusses various structural characterisations of axiomatic classes in terms of closure under certain constructions, including images of bisimulations, disjoint unions, ultrapowers and ‘prime extensions’. The prime extension of a model is a new model whose points are the prime filters of the lattice of upwardlyclosed subsets of the original model. We also construct and analyse a ‘definable ’ extension whose points are prime filters of definable sets. A structural explanation is given of why a class that is closed under images of bisimulations and invariant under prime/definable extensions must be invariant under arbitrary ultrapowers. This uses iterated ultrapowers and saturation.
Distributive Substructural Logics as Coalgebraic Logics over Posets
"... We show how to understand frame semantics of distributive substructural logics coalgebraically, thus opening a possibility to study them as coalgebraic logics. As an application of this approach we prove a general version of GoldblattThomason theorem that characterizes definability of classes of fr ..."
Abstract
 Add to MetaCart
We show how to understand frame semantics of distributive substructural logics coalgebraically, thus opening a possibility to study them as coalgebraic logics. As an application of this approach we prove a general version of GoldblattThomason theorem that characterizes definability of classes of frames for logics extending the distributive Full Lambek logic, as e.g. relevance logics, manyvalued logics or intuitionistic logic. The paper is rather conceptual and does not claim to contain significant new results. We consider a category of frames as posets equipped with monotone relations, and show that they can be understood as coalgebras for an endofunctor of the category of posets. In fact, we adopt a more general definition of frames that allows to cover a wider class of distributive modal logics. GoldblattThomason theorem for classes of resulting coalgebras for instance shows that frames for axiomatic extensions of distributive Full Lambek logic are modally definable classes of certain coalgebras, the respective modal algebras being precisely the corresponding subvarieties of distributive residuated lattices.