Results 1 
7 of
7
Erdős Graphs Resolve Fine's Canonicity Problem
 THE BULLETIN OF SYMBOLIC LOGIC
, 2003
"... We show that there exist 2^ℵ0 equational classes of Boolean algebras with operators that are not generated by the complex algebras of any firstorder definable class of relational structures. Using a variant of this construction, we resolve a longstanding question of Fine, by exhibiting ..."
Abstract

Cited by 12 (8 self)
 Add to MetaCart
We show that there exist 2^&alefsym;0 equational classes of Boolean algebras with operators that are not generated by the complex algebras of any firstorder definable class of relational structures. Using a variant of this construction, we resolve a longstanding question of Fine, by exhibiting a bimodal logic that is valid in its canonical frames, but is not sound and complete for any firstorder definable class of Kripke frames. The constructions use the result of Erdős that there are finite graphs with arbitrarily large chromatic number and girth.
On canonical modal logics that are not elementarily determined. Logique et Analyse
 181:77— 101, 2003. Published October 2004. 20 Robert Goldblatt, Ian Hodkinson, and Yde
, 2004
"... There exist modal logics that are validated by their canonical frames but are not sound and complete for any elementary class of frames. Continuum many such bimodal logics are exhibited, including one of each degree of unsolvability, and all with the finite model property. Monomodal examples are als ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
(Show Context)
There exist modal logics that are validated by their canonical frames but are not sound and complete for any elementary class of frames. Continuum many such bimodal logics are exhibited, including one of each degree of unsolvability, and all with the finite model property. Monomodal examples are also constructed that extend K4 and are related to the proof of noncanonicity of the McKinsey axiom. 1
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
(Show Context)
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
Algebraic Polymodal Logic: A Survey
 LOGIC JOURNAL OF THE IGPL
, 2000
"... This is a review of those aspects of the theory of varieties of Boolean algebras with operators (BAO's) that emphasise connections with modal logic and structural properties that are related to natural properties of logical systems. It begins with ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This is a review of those aspects of the theory of varieties of Boolean algebras with operators (BAO's) that emphasise connections with modal logic and structural properties that are related to natural properties of logical systems. It begins with
Fine’s Theorem on FirstOrder Complete Modal Logics
, 2011
"... Fine’s Canonicity Theorem states that if a modal logic is determined by a firstorder definable class of Kripke frames, then it is valid in its canonical frames. This article reviews the background and context of this result, and the history of its influence on further research. It then develops a n ..."
Abstract
 Add to MetaCart
(Show Context)
Fine’s Canonicity Theorem states that if a modal logic is determined by a firstorder definable class of Kripke frames, then it is valid in its canonical frames. This article reviews the background and context of this result, and the history of its influence on further research. It then develops a new characterisation of when a logic is canonically valid, providing a precise point of distinction with the property of firstorder completeness. 1 The Canonicity Theorem and Its Impact In his PhD research, completed in 1969, and over the next halfdozen years, Kit Fine made a series of fundamental contributions to the semantic analysis and metatheory of propositional modal logic, proving general theorems about notable classes of logics and providing examples of failure of some significant properties. This work included the following (in order of publication): • A study [6] of logics that have propositional quantifiers and are defined
Constant Modal Logics and Canonicity
"... If a modal logic is valid in its canonical frame, and its class of validating frames is invariant under bounded epimorphisms (or equivalently, closed under images of bisimulations), then the logic is axiomatizable by variablefree formulas. Hence its class of frames is firstorder definable. 1 ..."
Abstract
 Add to MetaCart
(Show Context)
If a modal logic is valid in its canonical frame, and its class of validating frames is invariant under bounded epimorphisms (or equivalently, closed under images of bisimulations), then the logic is axiomatizable by variablefree formulas. Hence its class of frames is firstorder definable. 1
Philosophical Prepublication Series at the University of Erfurt
, 2001
"... Abstract: While ceteris paribus laws (CPlaws) have been frequently discussed by philosophers, it has not been sufficiently considered that distinct kinds of CPlaws exist in science with rather different meanings. We distinguish between (1.) comparative CPlaws and (2.) exclusive CPlaws. There ex ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract: While ceteris paribus laws (CPlaws) have been frequently discussed by philosophers, it has not been sufficiently considered that distinct kinds of CPlaws exist in science with rather different meanings. We distinguish between (1.) comparative CPlaws and (2.) exclusive CPlaws. There exist also mixed CPlaws, which contain a comparative and an exclusive CPclause. Exclusive CPlaws may be either (2.1) definite, (2.2) indefinite or (2.3) normic. While CPlaws of kind (2.1) and (2.2) exhibit deductivistic behaviour, CPlaws of kind (2.3) require a probabilistic or nonmonotonic reconstruction. CPlaws of kinds (1) may be both deductivistic or probabilistic. All these kinds of CPlaws have empirical content by which they are testable, except CPlaws of kind (2.2) which are almost vacuous and hence not recommendable as scientific lawhypotheses. Typically, CPlaws of kind (1) express claims about invariant correlations, CPlaws of kind (2.1) are system laws of physical sciences based on idealization, and CPlaws of kind (2.3) are normic laws of nonphysical sciences based on evolutiontheoretic stability properties.