14 found
Order:
  1.  14
    On the $\kappa$ -cub game on $\lambda $ and $I[\lambda ]$.Taneli Huuskonen, Tapani Hyttinen & Mika Rautila - 1999 - Archive for Mathematical Logic 38 (8):549-557.
    We discuss the relationships between the notions of $\kappa $ -cub game on $\lambda $ , $\kappa $ -cub subset of $\lambda $ , the ideal of good subsets of $\lambda $ and the problem of adding a $\kappa $ -cub into a given $\kappa $ -stationary subset of $\lambda $ . We also give a short introduction to the ideal of good subsets of $\lambda $.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  2.  27
    Relational dual tableau decision procedures and their applications to modal and intuitionistic logics.Joanna Golińska-Pilarek, Taneli Huuskonen & Emilio Muñoz-Velasco - 2014 - Annals of Pure and Applied Logic 165 (2):409-427.
    This paper introduces Basic Intuitionistic Set Theory BIST, and investigates it as a first-order set theory extending the internal logic of elementary toposes. Given an elementary topos, together with the extra structure of a directed structural system of inclusions on the topos, a forcing-style interpretation of the language of first-order set theory in the topos is given, which conservatively extends the internal logic of the topos. This forcing interpretation applies to an arbitrary elementary topos, since any such is equivalent to (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  3.  8
    Relational dual tableau decision procedures and their applications to modal and intuitionistic logics.Joanna Golińska-Pilarek & Taneli Huuskonen - 2014 - Annals of Pure and Applied Logic 165 (2):428-502.
    This paper introduces Basic Intuitionistic Set Theory BIST, and investigates it as a first-order set theory extending the internal logic of elementary toposes. Given an elementary topos, together with the extra structure of a directed structural system of inclusions on the topos, a forcing-style interpretation of the language of first-order set theory in the topos is given, which conservatively extends the internal logic of the topos. This forcing interpretation applies to an arbitrary elementary topos, since any such is equivalent to (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  4.  35
    Non-Fregean Propositional Logic with Quantifiers.Joanna Golińska-Pilarek & Taneli Huuskonen - 2016 - Notre Dame Journal of Formal Logic 57 (2):249-279.
    We study the non-Fregean propositional logic with propositional quantifiers, denoted by $\mathsf{SCI}_{\mathsf{Q}}$. We prove that $\mathsf{SCI}_{\mathsf{Q}}$ does not have the finite model property and that it is undecidable. We also present examples of how to interpret in $\mathsf{SCI}_{\mathsf{Q}}$ various mathematical theories, such as the theory of groups, rings, and fields, and we characterize the spectra of $\mathsf{SCI}_{\mathsf{Q}}$-sentences. Finally, we present a translation of $\mathsf{SCI}_{\mathsf{Q}}$ into a classical two-sorted first-order logic, and we use the translation to prove some model-theoretic properties of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  5.  48
    Number of Extensions of Non-Fregean Logics.Joanna Golińska-Pilarek & Taneli Huuskonen - 2005 - Journal of Philosophical Logic 34 (2):193-206.
    We show that there are continuum many different extensions of SCI (the basic theory of non-Fregean propositional logic) that lie below WF (the Fregean extension) and are closed under substitution. Moreover, continuum many of them are independent from WB (the Boolean extension), continuum many lie above WB and are independent from WH (the Boolean extension with only two values for the equality relation), and only countably many lie between WH and WF.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  6.  41
    Comparing notions of similarity for uncountable models.Taneli Huuskonen - 1995 - Journal of Symbolic Logic 60 (4):1153-1167.
    The present article, which is a revised version of part of [Hu1], deals with various relations between models which might serve as exact formulations for the vague concept "similar" or "almost isomorphic". One natural class of such formulations is equivalence in a given logic. Another way to express similarity is by potential isomorphism, i.e., isomorphism in some extension of the set-theoretic universe. The class of extensions may be restricted to give different notions of potential isomorphism. A third method is to (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  7.  10
    On potential isomorphism and non-structure.Taneli Huuskonen, Tapani Hyttinen & Mika Rautila - 2004 - Archive for Mathematical Logic 43 (1):85-120.
    We show in the paper that for any non-classifiable countable theory T there are non-isomorphic models and that can be forced to be isomorphic without adding subsets of small cardinality. By making suitable cardinal arithmetic assumptions we can often preserve stationary sets as well. We also study non-structure theorems relative to the Ehrenfeucht-Fraïssé game.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  8.  7
    On the [mathematical formula]-cub game on [mathematical formula] and [mathematical formula].Taneli Huuskonen, Tapani Hyttinen & Mika Rautila - 1999 - Archive for Mathematical Logic 38 (8):549-557.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  9. Logic. of Descriptions. A New Approach to the Foundations of Mathematics and Science.Joanna Golińska-Pilarek & Taneli Huuskonen - 2012 - Studies in Logic, Grammar and Rhetoric 27 (40):63-94.
    We study a new formal logic LD introduced by Prof. Grzegorczyk. The logic is based on so-called descriptive equivalence, corresponding to the idea of shared meaning rather than shared truth value. We construct a semantics for LD based on a new type of algebras and prove its soundness and completeness. We further show several examples of classical laws that hold for LD as well as laws that fail. Finally, we list a number of open problems. -/- .
    Direct download  
     
    Export citation  
     
    Bookmark  
  10.  2
    The Construction of A Definable Non‐Categorical Domain.Taneli Huuskonen - 1991 - Mathematical Logic Quarterly 37 (13‐16):217-226.
  11.  26
    The Construction of A Definable Non‐Categorical Domain.Taneli Huuskonen - 1991 - Mathematical Logic Quarterly 37 (13-16):217-226.
  12.  4
    A Mystery of Grzegorczyk’s Logic of Descriptions.Joanna Golińska-Pilarek & Taneli Huuskonen - 2018 - In Urszula Wybraniec-Skardowska & Ángel Garrido (eds.), The Lvov-Warsaw School. Past and Present. Cham, Switzerland: Springer- Birkhauser,. pp. 731-745.
    In 2011, Andrzej Grzegorczyk formulated Logic of Descriptions, a new logical system in which the classical equivalence has been replaced with the descriptive equivalence. Two sentences are descriptively equivalent whenever they describe the same state of affairs. Grzegorczyk’s logic LD is built from the ground up by revising the axioms of classical propositional logic and rejecting those that do not correspond to the intended interpretation of the descriptive equivalence as the connective expressing equimeaning relations between sentences. Grzegorczyk’s last paper, which (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  13.  4
    Observations about Scott and Karp trees.Taneli Huuskonen - 1995 - Annals of Pure and Applied Logic 76 (3):201-230.
    Hyttinen and Väänänen study extensively the so-called Scott and Karp trees. Their paper leaves some open interesting questions:1. Are Scott trees closed under infimums?2. Are Karp trees closed under infimums?3. Does every Karp tree contain a subtree of small cardinality which is itself also a Karp tree?The present article addresses these questions. It turns out that there are counterexamples dictating a negative answer to and . The answer to question , however, is independent of the standard ZFC axioms of set (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  14.  16
    Small nonisomorphic models can be equivalent in long games.Taneli Huuskonen - 1991 - Bulletin of the Section of Logic 20 (3/4):105-106.
    Direct download  
     
    Export citation  
     
    Bookmark