Results for 'Kate Hodkinson'

1000+ found
Order:
  1. How Should a Nurse Approach Truth-Telling? A Virtue Ethics Perspective.Kate Hodkinson - 2008 - Nursing Philosophy 9 (4):248-256.
    Abstract Truth-telling is a key issue within the nurse–patient relationship. Nurses make decisions on a daily basis regarding what information to tell patients. This paper analyses truth-telling within an end of life scenario. Virtue ethics provides a useful philosophical approach for exploring decisions on information disclosure in more detail. Virtue ethics allows appropriate examination of the moral character of the nurse involved, their intention, ability to use wisdom and judgement when making decisions and the virtue of truth-telling. It is appropriate (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  2.  43
    The Need to Know—Therapeutic Privilege: A Way Forward. [REVIEW]Kate Hodkinson - 2013 - Health Care Analysis 21 (2):105-129.
    Providing patients with information is fundamental to respecting autonomy. However, there may be circumstances when information may be withheld to prevent serious harm to the patient, a concept referred to as therapeutic privilege. This paper provides an analysis of the ethical, legal and professional considerations which impact on a decision to withhold information that, in normal circumstances, would be given to the patient. It considers the status of the therapeutic privilege in English case law and concludes that, while reference is (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  3. Temporal Logic Mathematical Foundations and Computational Aspects.Dov M. Gabbay, Ian Hodkinson & Mark Reynolds - 1994
     
    Export citation  
     
    My bibliography   19 citations  
  4. Step by Step-Building Representations in Algebraic Logic.Robin Hirsch & Ian Hodkinson - 1997 - Journal of Symbolic Logic 62 (1):225-279.
    We consider the problem of finding and classifying representations in algebraic logic. This is approached by letting two players build a representation using a game. Homogeneous and universal representations are characterized according to the outcome of certain games. The Lyndon conditions defining representable relation algebras (for the finite case) and a similar schema for cylindric algebras are derived. Finite relation algebras with homogeneous representations are characterized by first order formulas. Equivalence games are defined, and are used to establish whether an (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  5. Relation Algebra Reducts of Cylindric Algebras and an Application to Proof Theory.Robin Hirsch, Ian Hodkinson & Roger D. Maddux - 2002 - Journal of Symbolic Logic 67 (1):197-213.
    We confirm a conjecture, about neat embeddings of cylindric algebras, made in 1969 by J. D. Monk, and a later conjecture by Maddux about relation algebras obtained from cylindric algebras. These results in algebraic logic have the following consequence for predicate logic: for every finite cardinal α ≥ 3 there is a logically valid sentence X, in a first-order language L with equality and exactly one nonlogical binary relation symbol E, such that X contains only 3 variables (each of which (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  6.  13
    Decidable Fragments of First-Order Temporal Logics.Ian Hodkinson, Frank Wolter & Michael Zakharyaschev - 2000 - Annals of Pure and Applied Logic 106 (1-3):85-134.
    In this paper, we introduce a new fragment of the first-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time structures can be reduced to the satisfiability problem for a certain fragment of classical first-order logic. This reduction is then used to single out a number of decidable fragments of first-order temporal logics and of two-sorted (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   10 citations  
  7.  6
    Spatial Logic of Tangled Closure Operators and Modal Mu-Calculus.Robert Goldblatt & Ian Hodkinson - 2017 - Annals of Pure and Applied Logic 168 (5):1032-1090.
  8. On Modal Logics Between K × K × K and $S5 \Times S5 \Times S5$.R. Hirsch, I. Hodkinson & A. Kurucz - 2002 - Journal of Symbolic Logic 67 (1):221 - 234.
    We prove that every n-modal logic between K n and S5 n is undecidable, whenever n ≥ 3. We also show that each of these logics is non- finitely axiomatizable, lacks the product finite model property, and there is no algorithm deciding whether a finite frame validates the logic. These results answer several questions of Gabbay and Shehtman. The proofs combine the modal logic technique of Yankov-Fine frame formulas with algebraic logic results of Halmos, Johnson and Monk, and give a (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  9.  12
    Atom Structures of Cylindric Algebras and Relation Algebras.Ian Hodkinson - 1997 - Annals of Pure and Applied Logic 89 (2):117-148.
    For any finite n 3 there are two atomic n-dimensional cylindric algebras with the same atom structure, with one representable, the other, not.Hence, the complex algebra of the atom structure of a representable atomic cylindric algebra is not always representable, so that the class RCAn of representable n-dimensional cylindric algebras is not closed under completions. Further, it follows by an argument of Venema that RCAn is not axiomatisable by Sahlqvist equations, and hence nor by equations where negation can only occur (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   9 citations  
  10.  36
    Provability with Finitely Many Variables.Robin Hirsch, Ian Hodkinson & Roger D. Maddux - 2002 - Bulletin of Symbolic Logic 8 (3):348-379.
    For every finite n ≥ 4 there is a logically valid sentence φ n with the following properties: φ n contains only 3 variables (each of which occurs many times); φ n contains exactly one nonlogical binary relation symbol (no function symbols, no constants, and no equality symbol): φ n has a proof in first-order logic with equality that contains exactly n variables, but no proof containing only n - 1 variables. This result was first proved using the machinery of (...)
    Direct download (10 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  11.  22
    Complete Representations in Algebraic Logic.Robin Hirsch & Ian Hodkinson - 1997 - Journal of Symbolic Logic 62 (3):816-847.
    A boolean algebra is shown to be completely representable if and only if it is atomic, whereas it is shown that neither the class of completely representable relation algebras nor the class of completely representable cylindric algebras of any fixed dimension (at least 3) are elementary.
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  12. On Modal Logics Between K × K × K and S5 × S5 × S.R. Hirsch, I. Hodkinson & A. Kurucz - 2002 - Journal of Symbolic Logic 67 (1):221-234.
  13.  30
    Finite Conformal Hypergraph Covers and Gaifman Cliques in Finite Structures.Ian Hodkinson & Martin Otto - 2003 - Bulletin of Symbolic Logic 9 (3):387-405.
    We provide a canonical construction of conformal covers for finite hypergraphs and present two immediate applications to the finite model theory of relational structures. In the setting of relational structures, conformal covers serve to construct guarded bisimilar companion structures that avoid all incidental Gaifman cliques-thus serving as a partial analogue in finite model theory for the usually infinite guarded unravellings. In hypergraph theoretic terms, we show that every finite hypergraph admits a bisimilar cover by a finite conformal hypergraph. In terms (...)
    Direct download (9 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  14.  85
    Loosely Guarded Fragment of First-Order Logic has the Finite Model Property.Ian Hodkinson - 2002 - Studia Logica 70 (2):205 - 240.
    We show that the loosely guarded and packed fragments of first-order logic have the finite model property. We use a construction of Herwig and Hrushovski. We point out some consequences in temporal predicate logic and algebraic logic.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  15. The McKinsey–Lemmon Logic is Barely Canonical.Robert Goldblatt & Ian Hodkinson - 2007 - Australasian Journal of Logic 5:1-19.
    We study a canonical modal logic introduced by Lemmon, and axiomatised by an infinite sequence of axioms generalising McKinsey’s formula. We prove that the class of all frames for this logic is not closed under elementary equivalence, and so is non-elementary. We also show that any axiomatisation of the logic involves infinitely many non-canonical formulas.
     
    Export citation  
     
    My bibliography   4 citations  
  16.  52
    Sahlqvist Correspondence for Modal Mu-Calculus.Johan van Benthem, Nick Bezhanishvili & Ian Hodkinson - 2012 - Studia Logica 100 (1-2):31-60.
  17.  3
    Hybrid Formulas and Elementarily Generated Modal Logics.Ian Hodkinson - 2006 - Notre Dame Journal of Formal Logic 47 (4):443-478.
    We characterize the modal logics of elementary classes of Kripke frames as precisely those modal logics that are axiomatized by modal axioms synthesized in a certain effective way from "quasi-positive" sentences of hybrid logic. These are pure positive hybrid sentences with arbitrary existential and relativized universal quantification over nominals. The proof has three steps. The first step is to use the known result that the modal logic of any elementary class of Kripke frames is also the modal logic of the (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  18.  3
    Loosely Guarded Fragment of First-Order Logic has the Finite Model Property.Ian Hodkinson - 2002 - Studia Logica 70 (2):205-240.
    We show that the loosely guarded and packed fragments of first-order logic have the finite model property. We use a construction of Herwig and Hrushovski. We point out some consequences in temporal predicate logic and algebraic logic.
    Direct download  
     
    Export citation  
     
    My bibliography   5 citations  
  19.  7
    Relation Algebras with N-Dimensional Relational Bases.Robin Hirsch & Ian Hodkinson - 2000 - Annals of Pure and Applied Logic 101 (2-3):227-274.
    We study relation algebras with n-dimensional relational bases in the sense of Maddux. Fix n with 3nω. Write Bn for the class of non-associative algebras with an n-dimensional relational basis, and RAn for the variety generated by Bn. We define a notion of relativised representation for algebras in RAn, and use it to give an explicit equational axiomatisation of RAn, and to reprove Maddux's result that RAn is canonical. We show that the algebras in Bn are precisely those that have (...))
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  20.  10
    Relation Algebras From Cylindric Algebras, I.Robin Hirsch & Ian Hodkinson - 2001 - Annals of Pure and Applied Logic 112 (2-3):225-266.
    We characterise the class S Ra CA n of subalgebras of relation algebra reducts of n -dimensional cylindric algebras by the notion of a ‘hyperbasis’, analogous to the cylindric basis of Maddux, and by representations. We outline a game–theoretic approximation to the existence of a representation, and how to use it to obtain a recursive axiomatisation of S Ra CA n.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  21.  12
    Strongly Representable Atom Structures of Cylindric Algebras.Robin Hirsch & Ian Hodkinson - 2009 - Journal of Symbolic Logic 74 (3):811-828.
    A cylindric algebra atom structure is said to be strongly representable if all atomic cylindric algebras with that atom structure are representable. This is equivalent to saying that the full complex algebra of the atom structure is a representable cylindric algebra. We show that for any finite n >3, the class of all strongly representable n-dimensional cylindric algebra atom structures is not closed under ultraproducts and is therefore not elementary. Our proof is based on the following construction. From an arbitrary (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  22.  7
    Relation Algebras From Cylindric Algebras, II.Robin Hirsch & Ian Hodkinson - 2001 - Annals of Pure and Applied Logic 112 (2-3):267-297.
    We prove, for each 4⩽ n ω , that S Ra CA n+1 cannot be defined, using only finitely many first-order axioms, relative to S Ra CA n . The construction also shows that for 5⩽n S Ra CA n is not finitely axiomatisable over RA n , and that for 3⩽m S Nr m CA n+1 is not finitely axiomatisable over S Nr m CA n . In consequence, for a certain standard n -variable first-order proof system ⊢ m (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  23.  18
    Monodic Packed Fragment with Equality is Decidable.Ian Hodkinson - 2002 - Studia Logica 72 (2):185-197.
    We prove decidability of satisfiability of sentences of the monodic packed fragment of first-order temporal logic with equality and connectives Until and Since, in models with various flows of time and domains of arbitrary cardinality. We also prove decidability over models with finite domains, over flows of time including the real order.
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  24.  14
    Bare Canonicity of Representable Cylindric and Polyadic Algebras.Jannis Bulian & Ian Hodkinson - 2013 - Annals of Pure and Applied Logic 164 (9):884-906.
    We show that for finite n⩾3n⩾3, every first-order axiomatisation of the varieties of representable n-dimensional cylindric algebras, diagonal-free cylindric algebras, polyadic algebras, and polyadic equality algebras contains an infinite number of non-canonical formulas. We also show that the class of structures for each of these varieties is non-elementary. The proofs employ algebras derived from random graphs.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  25.  20
    Finite Algebras of Relations Are Representable on Finite Sets.H. Andréka, I. Hodkinson & I. Németi - 1999 - Journal of Symbolic Logic 64 (1):243-267.
    Using a combinatorial theorem of Herwig on extending partial isomorphisms of relational structures, we give a simple proof that certain classes of algebras, including Crs, polyadic Crs, and WA, have the `finite base property' and have decidable universal theories, and that any finite algebra in each class is representable on a finite set.
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  26.  6
    Hellenistic and Roman Sparta: A Tale of Two Cities.Stephen Hodkinson, P. Cartledge & A. Spawforth - 1992 - Journal of Hellenic Studies 112:206.
  27.  2
    On Modal Logics Between {$\Roman K\Times\Roman K\Times \Roman K$} and {${\Rm S}5\Times{\Rm S}5\Times{\Rm S}5$}.R. Hirsch, I. Hodkinson & A. Kurucz - 2002 - Journal of Symbolic Logic 67 (1):221-234.
  28.  14
    Sahlqvist Correspondence for Modal Mu-Calculus.Johan Benthem, Nick Bezhanishvili & Ian Hodkinson - 2012 - Studia Logica 100 (1-2):31-60.
    We define analogues of modal Sahlqvist formulas for the modal mu-calculus, and prove a correspondence theorem for them.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  29.  16
    Alternatives to Athens: Varieties of Political Organization and Community in Ancient Greece.Roger Brock & Stephen Hodkinson (eds.) - 2000 - Oxford University Press.
    This volume contains eighteen essays by established and younger historians that examine non-democratic alternative political systems and ideologies--oligarchies, monarchies, mixed constitutions--along with diverse forms of communal and regional associations such as ethnoi, amphiktyonies, and confederacies. The papers, which span the length and breadth of the Hellenic world highlight the immense political flexibility and diversity of ancient Greek civilization.
    Direct download  
     
    Export citation  
     
    My bibliography   2 citations  
  30.  2
    Omega-Categoricity, Relative Categoricity and Coordinatisation.Wilfrid Hodges, I. M. Hodkinson & Dugald Macpherson - 1990 - Annals of Pure and Applied Logic 46 (2):169-199.
  31.  21
    Erdős Graphs Resolve Fine's Canonicity Problem.Robert Goldblatt, Ian Hodkinson & Yde Venema - 2004 - Bulletin of Symbolic Logic 10 (2):186-208.
    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 (...)
    Direct download (9 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  32.  48
    Weak Representations of Relation Algebras and Relational Bases.Robin Hirsch, Ian Hodkinson & Roger D. Maddux - 2011 - Journal of Symbolic Logic 76 (3):870 - 882.
    It is known that for all finite n ≥ 5, there are relation algebras with n-dimensional relational bases but no weak representations. We prove that conversely, there are finite weakly representable relation algebras with no n-dimensional relational bases. In symbols: neither of the classes RA n and wRRA contains the other.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  33.  19
    All Normal Extensions of S5-Squared Are Finitely Axiomatizable.Nick Bezhanishvili & Ian Hodkinson - 2004 - Studia Logica 78 (3):443-457.
    We prove that every normal extension of the bi-modal system S52 is finitely axiomatizable and that every proper normal extension has NP-complete satisfiability problem.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  34.  36
    Mosaics and Step-by-Step| Remarks onA Modal Logic of Relations' by Venema & Marx.Robin Hirsch & Ian Hodkinson - 1999 - In E. Orłowska (ed.), Logic at Work. Heidelberg.
    Direct download  
     
    Export citation  
     
    My bibliography  
  35.  28
    Finite H-Dimension Does Not Imply Expressive Completeness.Ian Hodkinson - 1994 - Journal of Philosophical Logic 23 (5):535 - 573.
    A conjecture of Gabbay (1981) states that any class of flows of time having the property known as finite H-dimension admits a finite set of expressively complete one-dimensional temporal connectives. Here we show that the class of 'circular' structures refutes the generalisation of this conjecture to Kripke frames. We then construct from this class, by a general method, a new class of irreflexive transitive flows of time that refutes the original conjecture. Our paper includes full descriptions of a method for (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  36.  6
    Complexity of Monodic Guarded Fragments Over Linear and Real Time.Ian Hodkinson - 2006 - Annals of Pure and Applied Logic 138 (1):94-125.
    We show that the satisfiability problem for the monodic guarded, loosely guarded, and packed fragments of first-order temporal logic with equality is 2Exptime-complete for structures with arbitrary first-order domains, over linear time, dense linear time, rational number time, and some other classes of linear flows of time. We then show that for structures with finite first-order domains, these fragments are also 2Exptime-complete over real number time and hence over most of the commonly used linear flows of time, including the natural (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  37.  6
    Athens and Sparta: Constructing Greek Political and Social History From 478 BC.Stephen Hodkinson & A. Powell - 1989 - Journal of Hellenic Studies 109:251.
  38.  10
    The Gymnasium of Virtue. Education and Culture in Ancient Sparta.Stephen Hodkinson & N. M. Kennell - 1997 - Journal of Hellenic Studies 117:240.
  39. Demandingness, Indebtedness, and Charity: Kant on Imperfect Duties to Others.Moran Kate - 2017 - In Matthew C. Altman (ed.), The Palgrave Kant Handbook.
     
    Export citation  
     
    My bibliography  
  40.  3
    Spartan Law.Stephen Hodkinson & D. M. MacDowell - 1987 - Journal of Hellenic Studies 107:231.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  41. REVIEWS-Relation Algebras by Games.R. Hirsh, I. Hodkinson & Roger D. Maddux - 2003 - Bulletin of Symbolic Logic 9 (4):515-519.
     
    Export citation  
     
    My bibliography   1 citation  
  42.  5
    Axiomatising Various Classes of Relation and Cylindric Algebras.Robin Hirsch & Ian Hodkinson - 1997 - Logic Journal of the IGPL 5 (2):209-229.
    We outline a simple approach to axiomatising the class of representable relation algebras, using games. We discuss generalisations of the method to cylindric algebras, homogeneous and complete representations, and atom structures of relation algebras.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  43.  6
    The Finite Model Property for Logics with the Tangle Modality.Robert Goldblatt & Ian Hodkinson - 2018 - Studia Logica 106 (1):131-166.
    The tangle modality is a propositional connective that extends basic modal logic to a language that is expressively equivalent over certain classes of finite frames to the bisimulation-invariant fragments of both first-order and monadic second-order logic. This paper axiomatises several logics with tangle, including some that have the universal modality, and shows that they have the finite model property for Kripke frame semantics. The logics are specified by a variety of conditions on their validating frames, including local and global connectedness (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  44.  17
    On Canonical Modal Logics That Are Not Elementarily Determined.Robert Goldblatt, Ian Hodkinson & Yde Venema - 2003 - Logique Et Analyse 181:77-101.
  45.  15
    Incidence of Red–Green Colour Blindness in Some Populations of Delhi, Maharashtra and West Bengal: An Examination of the Selection Relaxation Hypothesis.B. N. Mukherjee, K. C. Malhotra & S. L. Kate - 1979 - Journal of Biosocial Science 11 (1):11.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  46.  19
    On the Number of Variables Required for Proofs.R. Hirsch, I. Hodkinson & Roger Maddux - 2002 - Journal of Symbolic Logic 67 (1):197-213.
  47.  26
    The K-Variable Property is Stronger Than H-Dimension K.Ian Hodkinson & András Simon - 1997 - Journal of Philosophical Logic 26 (1):81-101.
    We study the notion of H-dimension and the formally stronger k-variable property, as considered by Gabbay, Immerman and Kozen. We exhibit a class of flows of time that has H-dimension 3, and admits a finite expressively complete set of onedimensional temporal connectives, but does not have the k-variable property for any finite k.
    Direct download (9 more)  
     
    Export citation  
     
    My bibliography  
  48. Complete Representations in Algebraic Logic.Robin Hirsch & Ian Hodkinson - 1997 - Journal of Symbolic Logic 62 (3):816-847.
    A boolean algebra is shown to be completely representable if and only if it is atomic, whereas it is shown that neither the class of completely representable relation algebras nor the class of completely representable cylindric algebras of any fixed dimension are elementary.
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  49. Step by Step-Building Representations in Algebraic Logic.Robin Hirsch & Ian Hodkinson - 1997 - Journal of Symbolic Logic 62 (1):225-279.
    We consider the problem of finding and classifying representations in algebraic logic. This is approached by letting two players build a representation using a game. Homogeneous and universal representations are characterized according to the outcome of certain games. The Lyndon conditions defining representable relation algebras and a similar schema for cylindric algebras are derived. Finite relation algebras with homogeneous representations are characterized by first order formulas. Equivalence games are defined, and are used to establish whether an algebra is $\omega$-categorical. We (...)
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  50.  31
    J. F. Lazenby: The Spartan Army. Pp. Xiii + 210; 13 Plates, 14 Maps and Plans. Warminster: Aris and Phillips, 1985. Paper, £16. [REVIEW]Stephen Hodkinson - 1986 - The Classical Review 36 (02):327-328.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
1 — 50 / 1000