Results for 'Key words or phrases: Weak Freese–Nation property – Cohen models – Cichoń's diagram – Superatomic Boolean algebras'

1000+ found
Order:
  1.  50
    On the weak Freese–Nation property of ?(ω).Sakaé Fuchino, Stefan Geschke & Lajos Soukupe - 2001 - Archive for Mathematical Logic 40 (6):425-435.
    Continuing [6], [8] and [16], we study the consequences of the weak Freese-Nation property of (?(ω),⊆). Under this assumption, we prove that most of the known cardinal invariants including all of those appearing in Cichoń's diagram take the same value as in the corresponding Cohen model. Using this principle we could also strengthen two results of W. Just about cardinal sequences of superatomic Boolean algebras in a Cohen model. These results show (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  2.  26
    On the weak Freese-Nation property of complete Boolean algebras.Sakaé Fuchino, Stefan Geschke, Saharon Shelah & Lajos Soukup - 2001 - Annals of Pure and Applied Logic 110 (1-3):89-105.
    The following results are proved: In a model obtained by adding ℵ 2 Cohen reals , there is always a c.c.c. complete Boolean algebra without the weak Freese-Nation property. Modulo the consistency strength of a supercompact cardinal , the existence of a c.c.c. complete Boolean algebra without the weak Freese-Nation property is consistent with GCH. If a weak form of □ μ and cof =μ + hold for each μ >cf= ω , (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  13
    A superatomic Boolean algebra with few automorphisms.Matatyahu Rubin & Sabine Koppelberg - 2001 - Archive for Mathematical Logic 40 (2):125-129.
    Assuming GCH, we prove that for every successor cardinal μ > ω1, there is a superatomic Boolean algebra B such that |B| = 2μ and |Aut B| = μ. Under ◊ω1, the same holds for μ = ω1. This answers Monk's Question 80 in [Mo].
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  25
    Partial orderings with the weak Freese-Nation property.Sakaé Fuchino, Sabine Koppelberg & Saharon Shelah - 1996 - Annals of Pure and Applied Logic 80 (1):35-54.
    A partial ordering P is said to have the weak Freese-Nation property if there is a mapping tf : P → [P]0 such that, for any a, b ε P, if a b then there exists c ε tf∩tf such that a c b. In this note, we study the WFN and some of its generalizations. Some features of the class of Boolean algebras with the WFN seem to be quite sensitive to additional axioms of set (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  5.  85
    The spectrum of partitions of a Boolean algebra.J. Donald Monk - 2001 - Archive for Mathematical Logic 40 (4):243-254.
    The main notion dealt with in this article is where A is a Boolean algebra. A partition of 1 is a family ofnonzero pairwise disjoint elements with sum 1. One of the main reasons for interest in this notion is from investigations about maximal almost disjoint families of subsets of sets X, especially X=ω. We begin the paper with a few results about this set-theoretical notion.Some of the main results of the paper are:• (1) If there is a maximal (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  6.  30
    Cichoń’s diagram, regularity properties and $${\varvec{\Delta}^1_3}$$ Δ 3 1 sets of reals.Vera Fischer, Sy David Friedman & Yurii Khomskii - 2014 - Archive for Mathematical Logic 53 (5-6):695-729.
    We study regularity properties related to Cohen, random, Laver, Miller and Sacks forcing, for sets of real numbers on the Δ31\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Delta}^1_3}$$\end{document} level of the projective hieararchy. For Δ21\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Delta}^1_2}$$\end{document} and Σ21\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Sigma}^1_2}$$\end{document} sets, the relationships between these properties follows the pattern of the well-known Cichoń diagram for cardinal characteristics of the continuum. It is (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  7.  51
    Leibniz filters and the strong version of a protoalgebraic logic.Josep Maria Font & Ramon Jansana - 2001 - Archive for Mathematical Logic 40 (6):437-465.
    A filter of a sentential logic ? is Leibniz when it is the smallest one among all the ?-filters on the same algebra having the same Leibniz congruence. This paper studies these filters and the sentential logic ?+ defined by the class of all ?-matrices whose filter is Leibniz, which is called the strong version of ?, in the context of protoalgebraic logics with theorems. Topics studied include an enhanced Correspondence Theorem, characterizations of the weak algebraizability of ?+ and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  8.  51
    More on cichoń's diagram and infinite games.Masaru Kada - 2000 - Journal of Symbolic Logic 65 (4):1713-1724.
    Some cardinal invariants from Cichon's diagram can be characterized using the notion of cut-and-choose games on cardinals. In this paper we give another way to characterize those cardinals in terms of infinite games. We also show that some properties for forcing, such as the Sacks Property, the Laver Property and ω ω -boundingness, are characterized by cut-and-choose games on complete Boolean algebras.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  9.  52
    The algebraic structure of the isomorphic types of tally, polynomial time computable sets.Yongge Wang - 2002 - Archive for Mathematical Logic 41 (3):215-244.
    We investigate the polynomial time isomorphic type structure of (the class of tally, polynomial time computable sets). We partition P T into six parts: D −, D^ − , C, S, F, F^, and study their p-isomorphic properties separately. The structures of , , and are obvious, where F, F^, and C are the class of tally finite sets, the class of tally co-finite sets, and the class of tally bi-dense sets respectively. The following results for the structures of and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  10.  15
    Lebesgue Measure Zero Modulo Ideals on the Natural Numbers.Viera Gavalová & Diego A. Mejía - forthcoming - Journal of Symbolic Logic:1-31.
    We propose a reformulation of the ideal $\mathcal {N}$ of Lebesgue measure zero sets of reals modulo an ideal J on $\omega $, which we denote by $\mathcal {N}_J$. In the same way, we reformulate the ideal $\mathcal {E}$ generated by $F_\sigma $ measure zero sets of reals modulo J, which we denote by $\mathcal {N}^*_J$. We show that these are $\sigma $ -ideals and that $\mathcal {N}_J=\mathcal {N}$ iff J has the Baire property, which in turn is equivalent (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11.  38
    Boolean deductive systems of BL-algebras.Esko Turunen - 2001 - Archive for Mathematical Logic 40 (6):467-473.
    BL-algebras rise as Lindenbaum algebras from many valued logic introduced by Hájek [2]. In this paper Boolean ds and implicative ds of BL-algebras are defined and studied. The following is proved to be equivalent: (i) a ds D is implicative, (ii) D is Boolean, (iii) L/D is a Boolean algebra. Moreover, a BL-algebra L contains a proper Boolean ds iff L is bipartite. Local BL-algebras, too, are characterized. These results generalize some theorems (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  12. πολλαχῶς ἔστι; Plato’s Neglected Ontology.Mohammad Bagher Ghomi - manuscript
    This paper aims to suggest a new approach to Plato’s theory of being in Republic V and Sophist based on the notion of difference and the being of a copy. To understand Plato’s ontology in these two dialogues we are going to suggest a theory we call Pollachos Esti; a name we took from Aristotle’s pollachos legetai both to remind the similarities of the two structures and to reach a consistent view of Plato’s ontology. Based on this theory, when Plato (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  13.  73
    Diamond principles in Cichoń’s diagram.Hiroaki Minami - 2005 - Archive for Mathematical Logic 44 (4):513-526.
    We present several models which satisfy CH and some ♦-like principles while others fail, answering a question of Moore, Hrušák and Džamonja.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  14.  66
    Future Directions for Human Cloning by Embryo Splitting: After the Hullabaloo.Cynthia B. Cohen - 1994 - Kennedy Institute of Ethics Journal 4 (3):187-192.
    In lieu of an abstract, here is a brief excerpt of the content:Future Directions for Human Cloning by Embryo Splitting:After the HullabalooCynthia B. Cohen (bio)In October 1993, a paper entitled, "Experimental Cloning of Human Polyploid Embryos Using an Artificial Zona Pellucida," was presented at a joint meeting of the American Fertility Society and the Canadian Fertility and Andrology Society. Although it was awarded a prize, its authors, who are affiliated with George Washington University, decided against calling a press conference (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  15.  20
    Property {(hbar)} and cellularity of complete Boolean algebras.Miloš S. Kurilić & Stevo Todorčević - 2009 - Archive for Mathematical Logic 48 (8):705-718.
    A complete Boolean algebra ${\mathbb{B}}$ satisfies property ${(\hbar)}$ iff each sequence x in ${\mathbb{B}}$ has a subsequence y such that the equality lim sup z n = lim sup y n holds for each subsequence z of y. This property, providing an explicit definition of the a posteriori convergence in complete Boolean algebras with the sequential topology and a characterization of sequential compactness of such spaces, is closely related to the cellularity of Boolean (...). Here we determine the position of property ${(\hbar)}$ with respect to the hierarchy of conditions of the form κ-cc. So, answering a question from Kurilić and Pavlović (Ann Pure Appl Logic 148(1–3):49–62, 2007), we show that ${``\mathfrak{h}{\rm -cc}\Rightarrow (\hbar)"}$ is not a theorem of ZFC and that there is no cardinal ${\mathfrak{k}}$ , definable in ZFC, such that ${``\mathfrak{k} {\rm -cc} \Leftrightarrow (\hbar)"}$ is a theorem of ZFC. Also, we show that the set ${\{ \kappa : {\rm each}\, \kappa{\rm -cc\, c.B.a.\, has}\, (\hbar ) \}}$ is equal to ${[0, \mathfrak{h})}$ or ${[0, {\mathfrak h}]}$ and that both values are consistent, which, with the known equality ${{\{\kappa : {\rm each\, c.B.a.\, having }\, (\hbar )\, {\rm has\, the}\, \kappa {\rm -cc } \} =[{\mathfrak s}, \infty )}}$ completes the picture. (shrink)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  16.  10
    Models with second order properties IV. A general method and eliminating diamonds.Saharon Shelah - 1983 - Annals of Pure and Applied Logic 25 (2):183-212.
    We show how to build various models of first-order theories, which also have properties like: tree with only definable branches, atomic Boolean algebras or ordered fields with only definable automorphisms. For this we use a set-theoretic assertion, which may be interesting by itself on the existence of quite generic subsets of suitable partial orders of power λ + , which follows from ♦ λ and even weaker hypotheses . For a related assertion, which is equivalent to the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  17.  42
    On the Closure Properties of the Class of Full G-models of a Deductive System.Josep Maria Font, Ramon Jansana & Don Pigozzi - 2006 - Studia Logica 83 (1-3):215-278.
    In this paper we consider the structure of the class FGModS of full generalized models of a deductive system S from a universal-algebraic point of view, and the structure of the set of all the full generalized models of S on a fixed algebra A from the lattice-theoretical point of view; this set is represented by the lattice FACSs A of all algebraic closed-set systems C on A such that (A, C) ε FGModS. We relate some properties of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  18. Álgebras booleanas, órdenes parciales y axioma de elección.Franklin Galindo - 2017 - Divulgaciones Matematicas 18 ( 1):34-54.
    El objetivo de este artículo es presentar una demostración de un teorema clásico sobre álgebras booleanas y ordenes parciales de relevancia actual en teoría de conjuntos, como por ejemplo, para aplicaciones del método de construcción de modelos llamado “forcing” (con álgebras booleanas completas o con órdenes parciales). El teorema que se prueba es el siguiente: “Todo orden parcial se puede extender a una única álgebra booleana completa (salvo isomorfismo)”. Donde extender significa “sumergir densamente”. Tal demostración se realiza utilizando cortaduras de (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  19. Object-Oriented France: The Philosophy of Tristan Garcia.Graham Harman - 2012 - Continent 2 (1):6-21.
    continent. 2.1 (2012): 6–21. The French philosopher and novelist Tristan Garcia was born in Toulouse in 1981. This makes him rather young to have written such an imaginative work of systematic philosophy as Forme et objet , 1 the latest entry in the MétaphysiqueS series at Presses universitaires de France. But this reference to Garcia’s youthfulness is not a form of condescension: by publishing a complete system of philosophy in the grand style, he has already done what none of us (...)
     
    Export citation  
     
    Bookmark  
  20.  45
    On the Boolean algebras of definable sets in weakly o‐minimal theories.Stefano Leonesi & Carlo Toffalori - 2004 - Mathematical Logic Quarterly 50 (3):241-248.
    We consider the sets definable in the countable models of a weakly o-minimal theory T of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic , in other words when each of these definable sets admits, if infinite, an infinite coinfinite definable subset. We show that this is true if and only if T has no infinite definable discrete subset. We examine the same problem among arbitrary theories of mere linear orders. Finally (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  21.  18
    Diophantine definability over non-finitely generated non-degenerate modules of algebraic extensions of ℚ.Alexandra Shlapentokh - 2001 - Archive for Mathematical Logic 40 (4):297-328.
    We investigate the issues of Diophantine definability over the non-finitely generated version of non-degenerate modules contained in the infinite algebraic extensions of the rational numbers. In particular, we show the following. Let k be a number field and let K inf be a normal algebraic, possibly infinite, extension of k such that k has a normal extension L linearly disjoint from K inf over k. Assume L is totally real and K inf is totally complex. Let M inf be a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  22.  51
    A note on Spector's quantifier-free rule of extensionality.Ulrich Kohlenbach - 2001 - Archive for Mathematical Logic 40 (2):89-92.
    In this note we show that the so-called weakly extensional arithmetic in all finite types, which is based on a quantifier-free rule of extensionality due to C. Spector and which is of significance in the context of Gödel"s functional interpretation, does not satisfy the deduction theorem for additional axioms. This holds already for Π0 1-axioms. Previously, only the failure of the stronger deduction theorem for deductions from (possibly open) assumptions (with parameters kept fixed) was known.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  23.  56
    Computability-theoretic complexity of countable structures.Valentina S. Harizanov - 2002 - Bulletin of Symbolic Logic 8 (4):457-477.
    Computable model theory, also called effective or recursive model theory, studies algorithmic properties of mathematical structures, their relations, and isomorphisms. These properties can be described syntactically or semantically. One of the major tasks of computable model theory is to obtain, whenever possible, computability-theoretic versions of various classical model-theoretic notions and results. For example, in the 1950's, Fröhlich and Shepherdson realized that the concept of a computable function can make van der Waerden's intuitive notion of an explicit field precise. This led (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  24. Meillassoux’s Virtual Future.Graham Harman - 2011 - Continent 1 (2):78-91.
    continent. 1.2 (2011): 78-91. This article consists of three parts. First, I will review the major themes of Quentin Meillassoux’s After Finitude . Since some of my readers will have read this book and others not, I will try to strike a balance between clear summary and fresh critique. Second, I discuss an unpublished book by Meillassoux unfamiliar to all readers of this article, except those scant few that may have gone digging in the microfilm archives of the École normale (...)
     
    Export citation  
     
    Bookmark   2 citations  
  25.  25
    Independence of Boolean algebras and forcing.Miloš S. Kurilić - 2003 - Annals of Pure and Applied Logic 124 (1-3):179-191.
    If κω is a cardinal, a complete Boolean algebra is called κ-dependent if for each sequence bβ: β<κ of elements of there exists a partition of the unity, P, such that each pP extends bβ or bβ′, for κ-many βκ. The connection of this property with cardinal functions, distributivity laws, forcing and collapsing of cardinals is considered.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  26.  18
    Extensions of Hałkowska–Zajac's three-valued paraconsistent logic.Alexej P. Pynko - 2002 - Archive for Mathematical Logic 41 (3):299-307.
    As it was proved in [4, Sect. 3], the poset of extensions of the propositional logic defined by a class of logical matrices with equationally-definable set of distinguished values is a retract, under a Galois connection, of the poset of subprevarieties of the prevariety generated by the class of the underlying algebras of the defining matrices. In the present paper we apply this general result to the three-valued paraconsistent logic proposed by Hałkowska–Zajac [2]. Studying corresponding prevarieties, we prove that (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  27.  9
    On Sequences of Homomorphisms Into Measure Algebras and the Efimov Problem.Piotr Borodulin–Nadzieja & Damian Sobota - 2023 - Journal of Symbolic Logic 88 (1):191-218.
    For given Boolean algebras$\mathbb {A}$and$\mathbb {B}$we endow the space$\mathcal {H}(\mathbb {A},\mathbb {B})$of all Boolean homomorphisms from$\mathbb {A}$to$\mathbb {B}$with various topologies and study convergence properties of sequences in$\mathcal {H}(\mathbb {A},\mathbb {B})$. We are in particular interested in the situation when$\mathbb {B}$is a measure algebra as in this case we obtain a natural tool for studying topological convergence properties of sequences of ultrafilters on$\mathbb {A}$in random extensions of the set-theoretical universe. This appears to have strong connections with Dow and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  28.  10
    Decidability of topological quasi-Boolean algebras.Yiheng Wang, Zhe Lin & Minghui Ma - 2024 - Journal of Applied Non-Classical Logics 34 (2):269-293.
    A sequent calculus S for the variety tqBa of all topological quasi-Boolean algebras is established. Using a construction of syntactic finite algebraic model, the finite model property of S is shown, and thus the decidability of S is obtained. We also introduce two non-distributive variants of topological quasi-Boolean algebras. For the variety TDM5 of all topological De Morgan lattices with the axiom 5, we establish a sequent calculus S5 and prove that the cut elimination holds (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29.  13
    Review Essay: Aquinas, Modern Theology, and the Trinity.O. S. B. Guy Mansini - 2023 - Nova et Vetera 21 (4):1415-1420.
    In lieu of an abstract, here is a brief excerpt of the content:Review Essay:Aquinas, Modern Theology, and the TrinityGuy Mansini O.S.B.As one would expect from his Incarnate Lord, Thomas Joseph White's Trinity is no exercise in historical theology, although of course it calls on history, but aims to give us St. Thomas's theology as an enduring and so contemporary theology that both respects the creedal commitments of the Catholic Church and offers a more satisfying understanding of the Trinity than anything (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30.  24
    Superatomic Boolean algebras constructed from strongly unbounded functions.Juan Carlos Martínez & Lajos Soukup - 2011 - Mathematical Logic Quarterly 57 (5):456-469.
    Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that κ, λ are infinite cardinals such that κ++ + ≤ λ, κ<κ = κ and 2κ = κ+, and η is an ordinal with κ+ ≤ η < κ++ and cf = κ+. Then, in some cardinal-preserving generic extension there is a superatomic Boolean algebra equation image such that equation image, equation image for every α < η and equation image. Especially, equation image and equation (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  31.  29
    Continuum-Many Boolean Algebras of the Form [image] Borel.Michael Ray Oliver - 2004 - Journal of Symbolic Logic 69 (3):799 - 816.
    We examine the question of how many Boolean algebras, distinct up to isomorphism, that are quotients of the powerset of the naturals by Borel ideals, can be proved to exist in ZFC alone. The maximum possible value is easily seen to be the cardinality of the continuum $2^{\aleph_{0}}$ ; earlier work by Ilijas Farah had shown that this was the value in models of Martin's Maximum or some similar forcing axiom, but it was open whether there could (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  32.  6
    Consciousness and Machines: A Commentary Drawing on Japanese Philosophy.S. D. Noam Cook - 2024 - Philosophy East and West 74 (2):305-314.
    In lieu of an abstract, here is a brief excerpt of the content:Consciousness and Machines:A Commentary Drawing on Japanese PhilosophyS. D. Noam Cook (bio)Viewed from within the great unity of consciousness, thinking is a wave on the surface of a great intuition.Kitarō NishidaIntroductionRecent developments in AI have made the long-standing debate about what computers can and can't do a major public concern. What we understand the properties of such machines to be, and consequently how we design [End Page 305] and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  33.  8
    WORDS, WORDS, SDROW—and alas, WORDS: The Fate of Words and Language in Turbulent Times.Victor Castellani - 2024 - The European Legacy 29 (3-4):321-333.
    Everyone, even when asserting unchallengeable authority from God or Science, thinks in language, in words and phrases, in expressions of moral, social and political impact, fighting words and words with and over which we fight. However, debates among the educated can be irrelevant elsewhere, ineffective against the highly motivated whose dogma instructs and guides them, their voting and their arming. The degeneration of “democracy” to “tyranny” such as Plato’s Republic postulated threatens in some lands “of the (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  34.  23
    Language, Logic and Method.Robert S. Cohen & Marx W. Wartofsky (eds.) - 2012 - Springer, Dordrecht.
    Fundamental problems of the uses of formal techniques and of natural and instrumental practices have been raised again and again these past two decades, in many quarters and from varying viewpoints. We have brought a number of quite basic studies of these issues together in this volume, not linked con ceptually nor by any rigorously defined problematic, but rather simply some of the most interesting and even provocative of recent research accomplish ments. Most of these papers are derived from the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  35.  25
    Strictly positive measures on Boolean algebras.Mirna Džamonja & Grzegorz Plebanek - 2008 - Journal of Symbolic Logic 73 (4):1416-1432.
    We investigate strictly positive finitely additive measures on Boolean algebras and strictly positive Radon measures on compact zerodimensional spaces. The motivation is to find a combinatorial characterisation of Boolean algebras which carry a strictly positive finitely additive finite measure with some additional properties, such as separability or nonatomicity. A possible consistent characterisation for an algebra to carry a separable separable positive measure was suggested by Talagrand in 1980, which is that the Stone space K of the (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  36.  21
    Trees and Keislers problem.Ali Enayat - 2001 - Archive for Mathematical Logic 40 (4):273-276.
    We give a new negative solution to Keisler's problem regarding Skolem functions and elementary extensions. In contrast to existing ad hoc solutions due to Payne, Knight, and Lachlan, our solution uses well-known models.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  37.  28
    Evaluating models of robust word recognition with serial reproduction.Stephan C. Meylan, Sathvik Nair & Thomas L. Griffiths - 2021 - Cognition 210 (C):104553.
    Spoken communication occurs in a “noisy channel” characterized by high levels of environmental noise, variability within and between speakers, and lexical and syntactic ambiguity. Given these properties of the received linguistic input, robust spoken word recognition—and language processing more generally—relies heavily on listeners' prior knowledge to evaluate whether candidate interpretations of that input are more or less likely. Here we compare several broad-coverage probabilistic generative language models in their ability to capture human linguistic expectations. Serial reproduction, an experimental paradigm (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  38.  72
    On Boolean algebras and integrally closed commutative regular rings.Misao Nagayama - 1992 - Journal of Symbolic Logic 57 (4):1305-1318.
    In this paper we consider properties, related to model-completeness, of the theory of integrally closed commutative regular rings. We obtain the main theorem claiming that in a Boolean algebra B, the truth of a prenex Σn-formula whose parameters ai partition B, can be determined by finitely many conditions built from the first entry of Tarski invariant T(ai)'s, n-characteristic D(n, ai)'s and the quantities S(ai, l) and S'(ai, l) for $l < n$. Then we derive two important theorems. One claims (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  39.  36
    Continuum-many Boolean algebras of the form $\mathcal{p}(\omega)/\mathcal{I}, \mathcal{I}$ borel.Michael Ray Oliver - 2004 - Journal of Symbolic Logic 69 (3):799 - 816.
    We examine the question of how many Boolean algebras, distinct up to isomorphism, that are quotients of the powerset of the naturals by Borel ideals, can be proved to exist in ZFC alone. The maximum possible value is easily seen to be the cardinality of the continuum $2^{\aleph_{0}}$ ; earlier work by Ilijas Farah had shown that this was the value in models of Martin's Maximum or some similar forcing axiom, but it was open whether there could (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  40.  46
    Matrix iterations and Cichon’s diagram.Diego Alejandro Mejía - 2013 - Archive for Mathematical Logic 52 (3-4):261-278.
    Using matrix iterations of ccc posets, we prove the consistency with ZFC of some cases where the cardinals on the right hand side of Cichon’s diagram take two or three arbitrary values (two regular values, the third one with uncountable cofinality). Also, mixing this with the techniques in J Symb Log 56(3):795–810, 1991, we can prove that it is consistent with ZFC to assign, at the same time, several arbitrary regular values on the left hand side of Cichon’s (...). (shrink)
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  41.  34
    Internal Perception: The Role of Bodily Information in Concepts and Word Mastery.Luigi Pastore & Sara Dellantonio - 2017 - Berlin, Heidelberg: Springer Berlin Heidelberg. Edited by Luigi Pastore.
    Chapter 1 First Person Access to Mental States. Mind Science and Subjective Qualities -/- Abstract. The philosophy of mind as we know it today starts with Ryle. What defines and at the same time differentiates it from the previous tradition of study on mind is the persuasion that any rigorous approach to mental phenomena must conform to the criteria of scientificity applied by the natural sciences, i.e. its investigations and results must be intersubjectively and publicly controllable. In Ryle’s view, philosophy (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  42. Logic, mathematics, physics: from a loose thread to the close link: Or what gravity is for both logic and mathematics rather than only for physics.Vasil Penchev - 2023 - Astrophysics, Cosmology and Gravitation Ejournal 2 (52):1-82.
    Gravitation is interpreted to be an “ontomathematical” force or interaction rather than an only physical one. That approach restores Newton’s original design of universal gravitation in the framework of “The Mathematical Principles of Natural Philosophy”, which allows for Einstein’s special and general relativity to be also reinterpreted ontomathematically. The entanglement theory of quantum gravitation is inherently involved also ontomathematically by virtue of the consideration of the qubit Hilbert space after entanglement as the Fourier counterpart of pseudo-Riemannian space. Gravitation can be (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  43.  50
    Mill's `socialism'.Dale E. Miller - 2003 - Politics, Philosophy and Economics 2 (2):213-238.
    Insofar as John Stuart Mill can be accurately described as a socialist, his is a socialism that a classical liberal ought to be able to live with, if not to love. Mill's view is that capitalist economies should at some point undergo a `spontaneous' and incremental process of socialization, involving the formation of worker-controlled `socialistic' enterprises through either the transformation of `capitalistic' enterprises or creation de novo. This process would entail few violations of core libertarian principles. It would proceed by (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  44.  53
    The elementary diagram of a trivial, weakly minimal structure is near model complete.Michael C. Laskowski - 2009 - Archive for Mathematical Logic 48 (1):15-24.
    We prove that if M is any model of a trivial, weakly minimal theory, then the elementary diagram T(M) eliminates quantifiers down to Boolean combinations of certain existential formulas.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  45.  26
    Peirce's Logical Graphs for Boolean Algebras and Distributive Lattices.Minghui Ma - 2018 - Transactions of the Charles S. Peirce Society 54 (3):320.
    Peirce introduced Existential Graphs in late 1896, and they were systematically investigated in his 1903 Lowell Lectures. Alpha graphs for classical propositional logic constitute the first part of EGs. The second and the third parts are the beta graphs for first-order logic and the gamma graphs for modal and higher-order logics, among others. As a logical syntax, EGs are two-dimensional graphs, or diagrams, in contrast to the linear algebraic notations. Peirce's theory of EGs is not only a theory of logical (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  46.  5
    MA(ℵ0) restricted to complete Boolean algebras and choice.Eleftherios Tachtsis - 2021 - Mathematical Logic Quarterly 67 (4):420-431.
    It is a long standing open problem whether or not the Axiom of Countable Choice implies the fragment of Martin's Axiom either in or in. In this direction, we provide a partial answer by establishing that the Boolean Prime Ideal Theorem in conjunction with the Countable Union Theorem does not imply restricted to complete Boolean algebras in. Furthermore, we prove that the latter (formally) weaker form of and the Δ‐system Lemma are independent of each other in.We also (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  47. The Geometry of Negation.Massimo Warglien & Achille C. Varzi - 2003 - Journal of Applied Non-Classical Logics 13 (1):9-19.
    There are two natural ways of thinking about negation: (i) as a form of complementation and (ii) as an operation of reversal, or inversion (to deny that p is to say that things are “the other way around”). A variety of techniques exist to model conception (i), from Euler and Venn diagrams to Boolean algebras. Conception (ii), by contrast, has not been given comparable attention. In this note we outline a twofold geometric proposal, where the inversion metaphor is (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  48.  44
    A Situational Formal Ontology of the Tracatus.Natan Berber - 2008 - Polish Journal of Philosophy 2 (2):5-20.
    This paper disucsses the Boolean algebraic axiomatic system of situations suggested by the Polish logician Roman Suszko (1919-1979). The paper will specifically examine the adequacy of the axioms, definitions and theorems of Suszko’s system as a model for Ludwig Wittgenstein’s Tracatus Logico-Philosophicus. It will be shown how the formal properties of Suszko’s system - the atomicity and completeness of the Boolean algebraic system - can be employed in order to clarify key concepts of the situational part of the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  49.  23
    Poaching on men's philosophies of rhetoric: Eighteenth- and nineteenth-century rhetorical theory by women.Jane Donawerth - 2000 - Philosophy and Rhetoric 33 (3):243-258.
    In lieu of an abstract, here is a brief excerpt of the content:Philosophy and Rhetoric 33.3 (2000) 243-258 [Access article in PDF] Poaching on Men's Philosophies of Rhetoric: Eighteenth- and Nineteenth-Century Rhetorical Theory by Women Jane Donawerth Although their discussions have often been ignored in histories of rhetoric, women did participate in the development of philosophies of rhetoric in the eighteenth century and nineteenth century. 1 Most, like Hannah More, left to men preaching, politics, and law (the traditional genres of (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  50.  32
    A hierarchy of tree-automatic structures.Olivier Finkel & Stevo Todorčević - 2012 - Journal of Symbolic Logic 77 (1):350-368.
    We consider ω n -automatic structures which are relational structures whose domain and relations are accepted by automata reading ordinal words of length ω n for some integer n ≥ 1. We show that all these structures are ω-tree-automatic structures presentable by Muller or Rabin tree automata. We prove that the isomorphism relation for ω 2 -automatic (resp. ω n -automatic for n > 2) boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000