Robert Goldblatt
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Robert Goldblatt has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- David Friggens
Ministry of Business Innovation & Employment, Wellington, New Zealand
1 shared publication - Edwin D. Mares
Victoria University of Wellington
1 shared publication - Hajnal Andréka
Alfréd Rényi Institute of Mathematics
1 shared publication - Ian Hodkinson
Imperial College London
1 shared publication - István Németi
Alfréd Rényi Institute of Mathematics
1 shared publication - Yde Venema
University of Amsterdam
1 shared publication
Latest Publications
- 1 June 2009
- Published by Cambridge University Press (CUP) in The Review of Symbolic Logic
- Vol. 2 (2) , 310-341
CONSERVATIVITY OF HEYTING IMPLICATION OVER RELEVANT QUANTIFICATION
It is known that propositional relevant logics can be conservatively extended by the addition of a Heyting (intuitionistic) implication connective. We show that this same conservativity holds for a range of first-order relevant logics with strong identity axioms, using an adaptation of Fine’s stratified model theory. For systems without identity, the question of conservatively adding Heyting implication is thereby reduced to the question of conservatively adding the axioms for identity. Some results in this direction are also obtained. The conservative presence of Heyting implication allows the development of an alternative model theory for quantified relevant logics.
- 1 June 2009
- Published by Cambridge University Press (CUP) in The Review of Symbolic Logic
- Vol. 2 (2) , 310-341
CONSERVATIVITY OF HEYTING IMPLICATION OVER RELEVANT QUANTIFICATION
It is known that propositional relevant logics can be conservatively extended by the addition of a Heyting (intuitionistic) implication connective. We show that this same conservativity holds for a range of first-order relevant logics with strong identity axioms, using an adaptation of Fine’s stratified model theory. For systems without identity, the question of conservatively adding Heyting implication is thereby reduced to the question of conservatively adding the axioms for identity. Some results in this direction are also obtained. The conservative presence of Heyting implication allows the development of an alternative model theory for quantified relevant logics.
- Open Access
- 12 December 2008
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 20 (5) , 1069-1100
Deduction Systems for Coalgebras Over Measurable Spaces
A theory of infinitary deduction systems is developed for the modal logic of coalgebras for measurable polynomial functors on the category of measurable spaces. These functors have been shown by Moss and Viglizzo to have final coalgebras that represent certain universal type spaces in game-theoretic economics. A notable feature of the deductive machinery is an infinitary Countable Additivity Rule. A deductive construction of canonical spaces and coalgebras leads to completeness results. These give a proof-theoretic characterization of the semantic consequence relation for the logic of any measurable polynomial functor as the least deduction system satisfying Lindenbaum's Lemma. It is also the only Lindenbaum system that is sound. The theory is additionally worked out for Kripke polynomial functors, on the category of sets, that have infinite constant sets in their formation.
- 12 December 2008
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 20 (5) , 1069-1100
Open AccessDeduction Systems for Coalgebras Over Measurable Spaces
A theory of infinitary deduction systems is developed for the modal logic of coalgebras for measurable polynomial functors on the category of measurable spaces. These functors have been shown by Moss and Viglizzo to have final coalgebras that represent certain universal type spaces in game-theoretic economics. A notable feature of the deductive machinery is an infinitary Countable Additivity Rule. A deductive construction of canonical spaces and coalgebras leads to completeness results. These give a proof-theoretic characterization of the semantic consequence relation for the logic of any measurable polynomial functor as the least deduction system satisfying Lindenbaum's Lemma. It is also the only Lindenbaum system that is sound. The theory is additionally worked out for Kripke polynomial functors, on the category of sets, that have infinite constant sets in their formation.
- 21 August 2006
- Published by Elsevier in Theoretical Computer Science
- Vol. 360 (1-3) , 1-22
A modal proof theory for final polynomial coalgebras
- 21 August 2006
- Published by Elsevier in Theoretical Computer Science
- Vol. 360 (1-3) , 1-22
A modal proof theory for final polynomial coalgebras
- 12 March 2006
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 71 (1) , 163-187
An alternative semantics for quantified relevant logic
The quantified relevant logic RQ is given a new semantics in which a formula ∀xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are modelled as functions from variable-assignments to propositions, where a proposition is a set of worlds in a relevant model structure. A completeness proof is given for a basic quantificational system QR from which RQ is obtained by adding the axiom EC of ‘extensional confinement’: ∀x(A ⋁ B) → (A ⋁ ∀xB), with x not free in A. Validity of EC requires an additional model condition involving the boolean difference of propositions. A QR-model falsifying EC is constructed by forming the disjoint union of two natural arithmetical structures in which negation is interpreted by the minus operation.
- 12 March 2006
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 71 (1) , 163-187
An alternative semantics for quantified relevant logic
The quantified relevant logic RQ is given a new semantics in which a formula ∀xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are modelled as functions from variable-assignments to propositions, where a proposition is a set of worlds in a relevant model structure. A completeness proof is given for a basic quantificational system QR from which RQ is obtained by adding the axiom EC of ‘extensional confinement’: ∀x(A ⋁ B) → (A ⋁ ∀xB), with x not free in A. Validity of EC requires an additional model condition involving the boolean difference of propositions. A QR-model falsifying EC is constructed by forming the disjoint union of two natural arithmetical structures in which negation is interpreted by the minus operation.
- 1 June 2004
- Published by Cambridge University Press (CUP) in The Bulletin of Symbolic Logic
- Vol. 10 (2) , 186-208
Erdős Graphs Resolve Fine's Canonicity Problem
We show that there exist 2ℵ0 equational classes of Boolean algebras with operators that are not generated by the complex algebras of any first-order definable class of relational structures. Using a variant of this construction, we resolve a long-standing question of Fine, by exhibiting a bimodal logic that is valid in its canonical frames, but is not sound and complete for any first-order definable class of Kripke frames (a monomodal example can then be obtained using simulation results of Thomason). The constructions use the result of Erdos that there are finite graphs with arbitrarily large chromatic number and girth.
- 1 June 2004
- Published by Cambridge University Press (CUP) in The Bulletin of Symbolic Logic
- Vol. 10 (2) , 186-208
Erdős Graphs Resolve Fine's Canonicity Problem
We show that there exist 2ℵ0 equational classes of Boolean algebras with operators that are not generated by the complex algebras of any first-order definable class of relational structures. Using a variant of this construction, we resolve a long-standing question of Fine, by exhibiting a bimodal logic that is valid in its canonical frames, but is not sound and complete for any first-order definable class of Kripke frames (a monomodal example can then be obtained using simulation results of Thomason). The constructions use the result of Erdos that there are finite graphs with arbitrarily large chromatic number and girth.
- 1 January 2003
- Published by Springer Nature
- p. 109-144
Questions of Canonicity
- 1 June 2001
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 66 (2) , 497-508
Quasi-Modal Equivalence of Canonical Structures
A first-order sentence is quasi-modal if its class of models is closed under the modal validity preserving constructions of disjoint unions, inner substructures and bounded epimorphic images.It is shown that all members of the proper class of canonical structures of a modal logic Λ have the same quasi-modal first-order theory ΨΛ. The models of this theory determine a modal logic Λe which is the largest sublogic of Λ to be determined by an elementary class. The canonical structures of Λe also have ΨΛ as their quasi-modal theory.In addition there is a largest sublogic Λe of Λ that is determined by its canonical structures, and again the canonical structures of Λe have ΨΛ are their quasi-modal theory. Thus . Finally, we show that all finite structures validating Λ are models of ΨΛ, and that if Λ is determined by its finite structures, then ΨΛ is equal to the quasi-modal theory of these structures.
- 1 June 2001
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 66 (2) , 497-508
Quasi-Modal Equivalence of Canonical Structures
A first-order sentence is quasi-modal if its class of models is closed under the modal validity preserving constructions of disjoint unions, inner substructures and bounded epimorphic images.It is shown that all members of the proper class of canonical structures of a modal logic Λ have the same quasi-modal first-order theory ΨΛ. The models of this theory determine a modal logic Λe which is the largest sublogic of Λ to be determined by an elementary class. The canonical structures of Λe also have ΨΛ as their quasi-modal theory.In addition there is a largest sublogic Λe of Λ that is determined by its canonical structures, and again the canonical structures of Λe have ΨΛ are their quasi-modal theory. Thus . Finally, we show that all finite structures validating Λ are models of ΨΛ, and that if Λ is determined by its finite structures, then ΨΛ is equal to the quasi-modal theory of these structures.
- 30 May 1998
- Published by Elsevier in Theoretical Computer Science
- Vol. 198 (1-2) , 177-200
Enlargements of functional algebras for the lambda calculus
- 30 May 1998
- Published by Elsevier in Theoretical Computer Science
- Vol. 198 (1-2) , 177-200
Enlargements of functional algebras for the lambda calculus
- 12 March 1998
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 63 (1) , 163-184
Relativised quantification: Some canonical varieties of sequence-set algebras
This paper explores algebraic aspects of two modifications of the usual account of first-order quantifiers.Standard first-order quantificational logic is modelled algebraically by cylindric algebras. Prime examples of these are algebras whose members are sets of sequences: given a first-order model U for a language that is based on the set {υκ: κ < α} of variables, each formula φ is represented by the set of all those α-length sequences x = 〈xκ: κ < α〉 that satisfy φ in U. Such a sequence provides a value-assignment to the variables (υκ is assigned value xκ), but it may also be viewed geometrically as a point in the α-dimensional Cartesian spaceαU of all α-length sequences whose terms come from the underlying set U of U. Then existential quantification is represented by the operation of cylindrification. To explain this, define a binary relation Tκ on sequences by putting xTκy if and only if x and y differ at most at their κth coordinate, i.e., Then for any set X ⊆ αU, the set is the “cylinder” generated by translation of X parallel to the κth coordinate axis in αU. Given the standard semantics for the existential quantifier ∃υκ as it is evident that
- 12 March 1998
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 63 (1) , 163-184
Relativised quantification: Some canonical varieties of sequence-set algebras
This paper explores algebraic aspects of two modifications of the usual account of first-order quantifiers.Standard first-order quantificational logic is modelled algebraically by cylindric algebras. Prime examples of these are algebras whose members are sets of sequences: given a first-order model U for a language that is based on the set {υκ: κ < α} of variables, each formula φ is represented by the set of all those α-length sequences x = 〈xκ: κ < α〉 that satisfy φ in U. Such a sequence provides a value-assignment to the variables (υκ is assigned value xκ), but it may also be viewed geometrically as a point in the α-dimensional Cartesian spaceαU of all α-length sequences whose terms come from the underlying set U of U. Then existential quantification is represented by the operation of cylindrification. To explain this, define a binary relation Tκ on sequences by putting xTκy if and only if x and y differ at most at their κth coordinate, i.e., Then for any set X ⊆ αU, the set is the “cylinder” generated by translation of X parallel to the κth coordinate axis in αU. Given the standard semantics for the existential quantifier ∃υκ as it is evident that