Results for 'Recursively nowhere dense'

1000+ found
Order:
  1.  38
    Recursive baire classification and speedable functions.Cristian Calude, Gabriel Istrate & Marius Zimand - 1992 - Mathematical Logic Quarterly 38 (1):169-178.
  2.  34
    Density and Baire category in recursive topology.Iraj Kalantari & Larry Welch - 2004 - Mathematical Logic Quarterly 50 (4-5):381-391.
    We develop the concepts of recursively nowhere dense sets and sets that are recursively of first category and study closed sets of points in light of Baire's Category Theorem. Our theorems are primarily concerned with exdomains of recursive quantum functions and hence with avoidable points . An avoidance function is a recursive function which can be used to expel avoidable points from domains of recursive quantum functions. We define an avoidable set of points to be an (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  3.  30
    Degrees of recursively enumerable topological spaces.Iraj Kalantari & J. B. Remmel - 1983 - Journal of Symbolic Logic 48 (3):610-622.
    In [5], Metakides and Nerode introduced the study of recursively enumerable substructures of a recursively presented structure. The main line of study presented in [5] is to examine the effective content of certain algebraic structures. In [6], Metakides and Nerode studied the lattice of r.e. subspaces of a recursively presented vector space. This lattice was later studied by Kalantari, Remmel, Retzlaff and Shore. Similar studies have been done by Metakides and Nerode [7] for algebraically closed fields, by (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  4.  26
    Effective topological spaces II: A hierarchy.Iraj Kalantari & Galen Weitkamp - 1985 - Annals of Pure and Applied Logic 29 (2):207-224.
    This paper is an investigation of definability hierarchies on effective topological spaces. An open subset U of an effective space X is definable iff there is a parameter free definition φ of U so that the atomic predicate symbols of φ are recursively open relations on X . The complexity of a definable open set may be identified with the quantifier complexity of its definition. For example, a set U is an ∃∃∀∃-set if it has an ∃∃∀∃ parameter free (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  5.  41
    Meager nowhere-dense games (IV): N-tactics.Marion Scheepers - 1994 - Journal of Symbolic Logic 59 (2):603-605.
    We consider the infinite game where player ONE chooses terms of a strictly increasing sequence of first category subsets of a space and TWO chooses nowhere dense sets. If after ω innings TWO's nowhere dense sets cover ONE's first category sets, then TWO wins. We prove a theorem which implies for the real line: If TWO has a winning strategy which depends on the most recent n moves of ONE only, then TWO has a winning strategy (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  6.  15
    Free Boolean algebras and nowhere dense ultrafilters.Aleksander Błaszczyk - 2004 - Annals of Pure and Applied Logic 126 (1-3):287-292.
    An analogue of Mathias forcing is studied in connection of free Boolean algebras and nowhere dense ultrafilters. Some applications to rigid Boolean algebras are given.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  7.  30
    First order properties on nowhere dense structures.Nešetřil Jaroslav & Ossona De Mendez Patrice - 2010 - Journal of Symbolic Logic 75 (3):868-887.
    A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct vertices of A have distance at most 2d. This notion was isolated in the context of finite model theory by Ajtai and Gurevich and recently it played a prominent role in the study of homomorphism preservation theorems for special classes of structures (such as minor closed classes). (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  8.  33
    A Gδ ideal of compact sets strictly above the nowhere dense ideal in the Tukey order.Justin Tatch Moore & Sławomir Solecki - 2008 - Annals of Pure and Applied Logic 156 (2):270-273.
    We prove that there is a -ideal of compact sets which is strictly above in the Tukey order. Here is the collection of all compact nowhere dense subsets of the Cantor set. This answers a question of Louveau and Veličković asked in [Alain Louveau, Boban Veličković, Analytic ideals and cofinal types, Ann. Pure Appl. Logic 99 171–195].
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  9.  14
    The number of translates of a closed nowhere dense set required to cover a Polish group.Arnold W. Miller & Juris Steprāns - 2006 - Annals of Pure and Applied Logic 140 (1):52-59.
    For a Polish group let be the minimal number of translates of a fixed closed nowhere dense subset of required to cover . For many locally compact this cardinal is known to be consistently larger than which is the smallest cardinality of a covering of the real line by meagre sets. It is shown that for several non-locally compact groups . For example the equality holds for the group of permutations of the integers, the additive group of a (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  37
    A base-matrix lemma for sets of rationals modulo nowhere dense sets.Jörg Brendle & Diana Carolina Montoya - 2012 - Archive for Mathematical Logic 51 (3-4):305-317.
    We study some properties of the quotient forcing notions \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${Q_{tr(I)} = \wp(2^{< \omega})/tr(i)}$$\end{document} and PI = B(2ω)/I in two special cases: when I is the σ-ideal of meager sets or the σ-ideal of null sets on 2ω. We show that the remainder forcing RI = Qtr(I)/PI is σ-closed in these cases. We also study the cardinal invariant of the continuum \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathfrak{h}_{\mathbb{Q}}}$$\end{document}, the distributivity (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  11.  28
    B. Balcar and F. Franek. Independent families in complete Boolean algebras_. _Transactions of the American Mathematical Society_, vol. 274 (1982), pp. 607–618. - Bohuslav Balcar, Jan Pelant, and Petr Simon. _The space of ultrafilters on N covered by nowhere dense sets_. Fundamenta mathematicae, vol. 110 (1980), pp. 11–24. - Boban Velickovic. _OCA and automorphisms of P(ω)/fin. Topology and its applications, vol. 49 (1993), pp. 1–13.Klaas Pieter Hart, B. Balcar, F. Franek, Bohuslav Balcar, Jan Pelant, Petr Simon & Boban Velickovic - 2002 - Bulletin of Symbolic Logic 8 (4):554.
  12.  18
    B. Balcar and F. Franek. Independent families in complete Boolean algebras_. _Transactions of the American Mathematical Society_, vol. 274 (1982), pp. 607–618. - Bohuslav Balcar, Jan Pelant, and Petr Simon. _The space of ultrafilters on N covered by nowhere dense sets_. Fundamenta mathematicae, vol. 110 (1980), pp. 11–24. - Boban Velickovic. _OCA and automorphisms of P(ω)/fin. Topology and its applications, vol. 49 (1993), pp. 1–13. [REVIEW]Klaas Pieter Hart - 2002 - Bulletin of Symbolic Logic 8 (4):554-554.
  13. Nowhere simple sets and the lattice of recursively enumerable sets.Richard A. Shore - 1978 - Journal of Symbolic Logic 43 (2):322-330.
  14.  16
    Remarks on gaps in Dense (Q) / nwd.Teppo Kankaanpää - 2013 - Mathematical Logic Quarterly 59 (1-2):51-61.
    The structure Dense /nwd and gaps in analytic quotients of equation image have been studied in the literature 2, 3, 1. We prove that the structures Dense /nwd and equation image have gaps of type equation image, and there are no -gaps for equation image, where equation image is the additivity number of the meager ideal. We also prove the existence of -gaps in these structures. Finally we characterize the cofinality of the meager ideal equation image using families (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15.  25
    Gerald E. Sacks. The recursively enumerable degrees are dense. Annals of mathematics, ser. 2 vol. 80 (1964), pp. 300–312. [REVIEW]Robert W. Robinson - 1969 - Journal of Symbolic Logic 34 (2):294-295.
  16.  36
    Effectively and Noneffectively Nowhere Simple Sets.Valentina S. Harizanov - 1996 - Mathematical Logic Quarterly 42 (1):241-248.
    R. Shore proved that every recursively enumerable set can be split into two nowhere simple sets. Splitting theorems play an important role in recursion theory since they provide information about the lattice ϵ of all r. e. sets. Nowhere simple sets were further studied by D. Miller and J. Remmel, and we generalize some of their results. We characterize r. e. sets which can be split into two effectively nowhere simple sets, and r. e. sets which (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  17.  30
    Van Douwen’s diagram for dense sets of rationals.Jörg Brendle - 2006 - Annals of Pure and Applied Logic 143 (1-3):54-69.
    We investigate cardinal invariants related to the structure of dense sets of rationals modulo the nowhere dense sets. We prove that , thus dualizing the already known [B. Balcar, F. Hernández-Hernández, M. Hrušák, Combinatorics of dense subsets of the rationals, Fund. Math. 183 59–80, Theorem 3.6]. We also show the consistency of each of and . Our results answer four questions of Balcar, Hernández and Hrušák [B. Balcar, F. Hernández-Hernández, M. Hrušák, Combinatorics of dense subsets (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  18.  24
    Primitive recursive equivalence relations and their primitive recursive complexity.Luca San Mauro, Nikolay Bazhenov, Keng Meng Ng & Andrea Sorbi - forthcoming - Computability.
    The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence relations R and S on natural numbers, R is computably reducible to S if there is a computable function f:ω→ω that induces an injective map from R-equivalence classes to S-equivalence classes. In order to compare the complexity of equivalence relations which are computable, researchers considered also feasible variants of computable reducibility, such as the polynomial-time reducibility. (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  19.  13
    Remarks on gaps in \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}${\mathrm{Dense}(\mathbb {Q})/\mathbf {nwd}}$\end{document}.Teppo Kankaanpää - 2013 - Mathematical Logic Quarterly 59 (1-2):51-61.
    The structure \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathrm{Dense}(\mathbb {Q})/\mathbf {nwd}$\end{document} and gaps in analytic quotients of \documentclass{article}\usepackage{amssymb,mathrsfs}\begin{document}\pagestyle{empty}$\mathscr {P}(\omega )$\end{document} have been studied in the literature 2, 3, 1. We prove that the structures \documentclass{article}\usepackage{amssymb,mathrsfs}\begin{document}\pagestyle{empty}$\mathrm{Dense}(\mathbb {Q})/\mathbf {nwd}$\end{document} and \documentclass{article}\usepackage{amssymb,mathrsfs}\begin{document}\pagestyle{empty}$\mathscr {P}(\mathbb {Q})/\mathbf {nwd}$\end{document} have gaps of type \documentclass{article}\usepackage{amssymb,mathrsfs}\begin{document}\pagestyle{empty}$(\mathrm{add}( \mathscr {M}), \omega )$\end{document}, and there are no (λ, ω)-gaps for \documentclass{article}\usepackage{amssymb,mathrsfs}\begin{document}\pagestyle{empty}$\lambda < \mathrm{add}(\mathscr {M})$\end{document}, where \documentclass{article}\usepackage{amssymb,mathrsfs}\begin{document}\pagestyle{empty}$\mathrm{add}(\mathscr {M})$\end{document} is the additivity number of the meager ideal. We also prove the existence of (ω1, ω1)-gaps in these structures. Finally we (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20.  25
    Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.
    We study topological constructions in the recursion theoretic framework of the lattice of recursively enumerable open subsets of a topological space X. Various constructions produce complemented recursively enumerable open sets with additional recursion theoretic properties, as well as noncomplemented open sets. In contrast to techniques in classical topology, we construct a disjoint recursively enumerable collection of basic open sets which cannot be extended to a recursively enumerable disjoint collection of basic open sets whose union is (...) in X. (shrink)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  21. § 1. Introduction After seeing the Sacks Density Theorem [Sa2], Shoenfield conjectured [Sh2] that the recursively enumerable (re) degrees R form a dense structure as an upper semi-lattice analogously as the rationals are a dense structure as a linearly. [REVIEW]David P. Miller - 1981 - In M. Lerman, J. H. Schmerl & R. I. Soare (eds.), Logic Year 1979-80, the University of Connecticut, Usa. Springer Verlag. pp. 859--230.
  22.  6
    are Dense.Theodore A. Slaman - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion theory. Providence, R.I.: American Mathematical Society. pp. 42--195.
    Direct download  
     
    Export citation  
     
    Bookmark  
  23.  46
    The Isolated D. R. E. Degrees are Dense in the R. E. Degrees.Geoffrey Laforte - 1996 - Mathematical Logic Quarterly 42 (1):83-103.
    In the present paper we prove that the isolated differences of r. e. degrees are dense in the r. e. degrees.
    Direct download  
     
    Export citation  
     
    Bookmark   13 citations  
  24.  24
    Degrees containing members of thin Π10 classes are dense and co-dense.Rodney G. Downey, Guohua Wu & Yue Yang - 2018 - Journal of Mathematical Logic 18 (1):1850001.
    In [Countable thin [Formula: see text] classes, Ann. Pure Appl. Logic 59 79–139], Cenzer, Downey, Jockusch and Shore proved the density of degrees containing members of countable thin [Formula: see text] classes. In the same paper, Cenzer et al. also proved the existence of degrees containing no members of thin [Formula: see text] classes. We will prove in this paper that the c.e. degrees containing no members of thin [Formula: see text] classes are dense in the c.e. degrees. We (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  25.  35
    Automorphisms in the PTIME-Turing degrees of recursive sets.Christine Ann Haught & Theodore A. Slaman - 1997 - Annals of Pure and Applied Logic 84 (1):139-152.
    We consider questions related to the rigidity of the structure R, the PTIME-Turing degrees of recursive sets of strings together with PTIME-Turing reducibility, pT, and related structures; do these structures have nontrivial automorphisms? We prove that there is a nontrivial automorphism of an ideal of R. This can be rephrased in terms of partial relativizations. We consider the sets which are PTIME-Turing computable from a set A, and call this class PTIMEA. Our result can be stated as follows: There is (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  26. JTB Epistemology and the Gettier problem in the framework of topological epistemic logic.Thomas Mormann - 2023 - Review of Analytic Philosophy 3 (1):1 - 41.
    Abstract. Traditional epistemology of knowledge and belief can be succinctly characterized as JTB-epistemology, i.e., it is characterized by the thesis that knowledge is justified true belief. Since Gettier’s trail-blazing paper of 1963 this account has become under heavy attack. The aim of is paper is to study the Gettier problem and related issues in the framework of topological epistemic logic. It is shown that in the framework of topological epistemic logic Gettier situations necessarily occur for most topological models of knowledge (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  27.  48
    Cohen-stable families of subsets of integers.Miloš S. Kurilić - 2001 - Journal of Symbolic Logic 66 (1):257-270.
    A maximal almost disjoint (mad) family $\mathscr{A} \subseteq [\omega]^\omega$ is Cohen-stable if and only if it remains maximal in any Cohen generic extension. Otherwise it is Cohen-unstable. It is shown that a mad family, A, is Cohen-unstable if and only if there is a bijection G from ω to the rationals such that the sets G[A], A ∈A are nowhere dense. An ℵ 0 -mad family, A, is a mad family with the property that given any countable family (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  28. Saturating ultrafilters on N.D. H. Fremlin & P. J. Nyikos - 1989 - Journal of Symbolic Logic 54 (3):708-718.
    We discuss saturating ultrafilters on N, relating them to other types of nonprincipal ultrafilter. (a) There is an (ω,c)-saturating ultrafilter on $\mathbf{N} \operatorname{iff} 2^\lambda \leq \mathfrak{c}$ for every $\lambda and there is no cover of R by fewer than c nowhere dense sets. (b) Assume Martin's axiom. Then, for any cardinal κ, a nonprincipal ultrafilter on N is (ω,κ)-saturating iff it is almost κ-good. In particular, (i) p(κ)-point ultrafilters are (ω,κ)-saturating, and (ii) the set of (ω,κ)-saturating ultrafilters is (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  29.  28
    U-Meager sets when the cofinality and the coinitiality of U are uncountable.Bosko Zivaljevic - 1991 - Journal of Symbolic Logic 56 (3):906-914.
    We prove that every countably determined set C is U-meager if and only if every internal subset A of C is U-meager, provided that the cofinality and coinitiality of the cut U are both uncountable. As a consequence we prove that for such cuts a countably determined set C which intersects every U-monad in at most countably many points is U-meager. That complements a similar result in [KL]. We also give some partial solutions to some open problems from [KL]. We (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  30.  24
    On the Uniform Computational Content of the Baire Category Theorem.Vasco Brattka, Matthew Hendtlass & Alexander P. Kreuzer - 2018 - Notre Dame Journal of Formal Logic 59 (4):605-636.
    We study the uniform computational content of different versions of the Baire category theorem in the Weihrauch lattice. The Baire category theorem can be seen as a pigeonhole principle that states that a complete metric space cannot be decomposed into countably many nowhere dense pieces. The Baire category theorem is an illuminating example of a theorem that can be used to demonstrate that one classical theorem can have several different computational interpretations. For one, we distinguish two different logical (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  31. JTB-Epistemology and the Gettier Problem in the framework of topological epistemic logic.Thomas Mormann - 2023 - Review of Analytic Philosophy 3 (1):1 - 41.
    Traditional epistemology of knowledge and belief can be succinctly characterized as JTB-epistemology, i.e., it is characterized by the thesis that knowledge is justified true belief. Since Gettier’s trail-blazing paper of 1963 this account has become under heavy attack. The aim of is paper is to study the Gettier problem and related issues in the framework of topological epistemic logic. It is shown that in the framework of topological epistemic logic Gettier situations necessarily occur for most topological models of knowledge and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  32.  44
    Regular subalgebras of complete Boolean algebras.Aleksander Błaszczyk & Saharon Shelah - 2001 - Journal of Symbolic Logic 66 (2):792-800.
    It is proved that the following conditions are equivalent: (a) there exists a complete, atomless, σ-centered Boolean algebra, which does not contain any regular, atomless, countable subalgebra, (b) there exists a nowhere dense ultrafilter on ω. Therefore, the existence of such algebras is undecidable in ZFC. In "forcing language" condition (a) says that there exists a non-trivial σ-centered forcing not adding Cohen reals.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  33.  22
    Completely mitotic c.e. degrees and non-jump inversion.Evan J. Griffiths - 2005 - Annals of Pure and Applied Logic 132 (2-3):181-207.
    A completely mitotic computably enumerable degree is a c.e. degree in which every c.e. set is mitotic, or equivalently in which every c.e. set is autoreducible. There are known to be low, low2, and high completely mitotic degrees, though the degrees containing non-mitotic sets are dense in the c.e. degrees. We show that there exists an upper cone of c.e. degrees each of which contains a non-mitotic set, and that the completely mitotic c.e. degrees are nowhere dense (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  34.  16
    Mad families, forcing and the Suslin Hypothesis.Miloš S. Kurilić - 2005 - Archive for Mathematical Logic 44 (4):499-512.
    Let κ be a regular cardinal and P a partial ordering preserving the regularity of κ. If P is (κ-Baire and) of density κ, then there is a mad family on κ killed in all generic extensions (if and) only if below each p∈P there exists a κ-sized antichain. In this case a mad family on κ is killed (if and) only if there exists an injection from κ onto a dense subset of Ult(P) mapping the elements of onto (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  35.  24
    Splitting families and forcing.Miloš S. Kurilić - 2007 - Annals of Pure and Applied Logic 145 (3):240-251.
    According to [M.S. Kurilić, Cohen-stable families of subsets of the integers, J. Symbolic Logic 66 257–270], adding a Cohen real destroys a splitting family on ω if and only if is isomorphic to a splitting family on the set of rationals, , whose elements have nowhere dense boundaries. Consequently, implies the Cohen-indestructibility of . Using the methods developed in [J. Brendle, S. Yatabe, Forcing indestructibility of MAD families, Ann. Pure Appl. Logic 132 271–312] the stability of splitting families (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  36.  27
    The baire category theorem and cardinals of countable cofinality.Arnold W. Miller - 1982 - Journal of Symbolic Logic 47 (2):275-288.
    Let κ B be the least cardinal for which the Baire category theorem fails for the real line R. Thus κ B is the least κ such that the real line can be covered by κ many nowhere dense sets. It is shown that κ B cannot have countable cofinality. On the other hand it is consistent that the corresponding cardinal for 2 ω 1 be ℵ ω . Similar questions are considered for the ideal of measure zero (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  37.  8
    Finitary sequence spaces.Mark Mandelkern - 1993 - Mathematical Logic Quarterly 39 (1):416-430.
    This paper studies the metric structure of the space Hr of absolutely summable sequences of real numbers with at most r nonzero terms. Hr is complete, and is located and nowhere dense in the space of all absolutely summable sequences. Totally bounded and compact subspaces of Hr are characterized, and large classes of located, totally bounded, compact, and locally compact subspaces are constructed. The methods used are constructive in the strict sense. MSC: 03F65, 54E50.
    Direct download  
     
    Export citation  
     
    Bookmark  
  38.  29
    Packing Index of Subsets in Polish Groups.Taras Banakh, Nadya Lyaskovska & Dušan Repovš - 2009 - Notre Dame Journal of Formal Logic 50 (4):453-468.
    For a subset A of a Polish group G, we study the (almost) packing index pack( A) (respectively, Pack( A)) of A, equal to the supremum of cardinalities |S| of subsets $S\subset G$ such that the family of shifts $\{xA\}_{x\in S}$ is (almost) disjoint (in the sense that $|xA\cap yA|<|G|$ for any distinct points $x,y\in S$). Subsets $A\subset G$ with small (almost) packing index are large in a geometric sense. We show that $\pack}(A)\in\mathbb{N}\cup\{\aleph_0,\mathfrak{c}\}$ for any σ-compact subset A of a (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  39. Resplendent models and $${\Sigma_1^1}$$ -definability with an oracle.Andrey Bovykin - 2008 - Archive for Mathematical Logic 47 (6):607-623.
    In this article we find some sufficient and some necessary ${\Sigma^1_1}$ -conditions with oracles for a model to be resplendent or chronically resplendent. The main tool of our proofs is internal arguments, that is analogues of classical theorems and model-theoretic constructions conducted inside a model of first-order Peano Arithmetic: arithmetised back-and-forth constructions and versions of the arithmetised completeness theorem, namely constructions of recursively saturated and resplendent models from the point of view of a model of arithmetic. These internal arguments (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  40.  18
    Choice principles from special subsets of the real line.E. Tachtsis & K. Keremedis - 2003 - Mathematical Logic Quarterly 49 (5):444.
    We study the role the axiom of choice plays in the existence of some special subsets of ℝ and its power set ℘.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  41.  6
    Selected logic papers.Gerald E. Sacks - 1999 - River Edge, N.J.: World Scientific.
    Contents: Recursive Enumerability and the Jump Operator; On the Degrees Less Than 0'; A Simple Set Which Is Not Effectively Simple; The Recursively Enumerable Degrees Are Dense; Metarecursive Sets (with G Kreisel); Post's Problem, Admissible Ordinals and Regularity; On a Theorem of Lachlan and Marlin; A Minimal Hyperdegree (with R O Gandy); Measure-Theoretic Uniformity in Recursion Theory and Set Theory; Forcing with Perfect Closed Sets; Recursion in Objects of Finite Type; The a-Finite Injury Method (with S G Simpson); (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  42.  26
    The Ackermann functions are not optimal, but by how much?H. Simmons - 2010 - Journal of Symbolic Logic 75 (1):289-313.
    By taking a closer look at the construction of an Ackermann function we see that between any primitive recursive degree and its Ackermann modification there is a dense chain of primitive recursive degrees.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  43. The Poetry of Jeroen Mettes.Samuel Vriezen & Steve Pearce - 2012 - Continent 2 (1):22-28.
    continent. 2.1 (2012): 22–28. Jeroen Mettes burst onto the Dutch poetry scene twice. First, in 2005, when he became a strong presence on the nascent Dutch poetry blogosphere overnight as he embarked on his critical project Dichtersalfabet (Poet’s Alphabet). And again in 2011, when to great critical acclaim (and some bafflement) his complete writings were published – almost five years after his far too early death. 2005 was the year in which Dutch poetry blogging exploded. That year saw the foundation (...)
     
    Export citation  
     
    Bookmark  
  44.  41
    Dynamic Topological Logic Interpreted over Minimal Systems.David Fernández-Duque - 2011 - Journal of Philosophical Logic 40 (6):767-804.
    Dynamic Topological Logic ( ) is a modal logic which combines spatial and temporal modalities for reasoning about dynamic topological systems , which are pairs consisting of a topological space X and a continuous function f : X → X . The function f is seen as a change in one unit of time; within one can model the long-term behavior of such systems as f is iterated. One class of dynamic topological systems where the long-term behavior of f is (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  45. Classifying positive equivalence relations.Claudio Bernardi & Andrea Sorbi - 1983 - Journal of Symbolic Logic 48 (3):529-538.
    Given two (positive) equivalence relations ∼ 1 , ∼ 2 on the set ω of natural numbers, we say that ∼ 1 is m-reducible to ∼ 2 if there exists a total recursive function h such that for every x, y ∈ ω, we have $x \sim_1 y \operatorname{iff} hx \sim_2 hy$ . We prove that the equivalence relation induced in ω by a positive precomplete numeration is complete with respect to this reducibility (and, moreover, a "uniformity property" holds). This (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   26 citations  
  46. "Exterminate all the Brutes": Gaza 2009.Noam Chomsky - unknown
    That surely includes the timing of the assault: shortly before noon, when children were returning from school and crowds were milling in the streets of densely populated Gaza City. It took only a few minutes to kill over 200 people and wound 700, an auspicious opening to the mass slaughter of defenseless civilians trapped in a tiny cage with nowhere to flee.1..
    No categories
     
    Export citation  
     
    Bookmark  
  47.  21
    Homeless, Ill, and Psychiatrically Complex: The Grueling Carousel of Cassandra Lee.Laura Guidry-Grimes - 2019 - Hastings Center Report 49 (4):8-13.
    Ask any clinical ethics consultant, and they can tell you about their transformative cases. Some stick with us because all roads led nowhere. Cassandra Lee had a history of pulling out lines and tubes and a distaste of warming blankets. Her admission marked her thirtieth over the past year. Many of the challenges facing the hospital caring for her were not unique: significant psychiatric issues, prolonged nonadherence to medical advice, and end‐of‐life decision‐making combined to create an ethically dense (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  48.  19
    Uniform Density in Lindenbaum Algebras.V. Yu Shavrukov & Albert Visser - 2014 - Notre Dame Journal of Formal Logic 55 (4):569-582.
    In this paper we prove that the preordering $\lesssim $ of provable implication over any recursively enumerable theory $T$ containing a modicum of arithmetic is uniformly dense. This means that we can find a recursive extensional density function $F$ for $\lesssim $. A recursive function $F$ is a density function if it computes, for $A$ and $B$ with $A\lnsim B$, an element $C$ such that $A\lnsim C\lnsim B$. The function is extensional if it preserves $T$-provable equivalence. Secondly, we (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  49.  47
    Intervals containing exactly one c.e. degree.Guohua Wu - 2007 - Annals of Pure and Applied Logic 146 (1):91-102.
    Cooper proved in [S.B. Cooper, Strong minimal covers for recursively enumerable degrees, Math. Logic Quart. 42 191–196] the existence of a c.e. degree with a strong minimal cover . So is the greastest c.e. degree below . Cooper and Yi pointed out in [S.B. Cooper, X. Yi, Isolated d.r.e. degrees, University of Leeds, Dept. of Pure Math., 1995. Preprint] that this strongly minimal cover cannot be d.c.e., and meanwhile, they proposed the notion of isolated degrees: a d.c.e. degree is (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  50.  8
    A Report from the Front Lines: Conversations on Public Theology. A Festschrift in Honor of Robert Benne_, and: _Explorations in Christian Theology and Ethics: Essays in Conversation with Paul L. Lehmann.Jeffrey P. Greenman - 2012 - Journal of the Society of Christian Ethics 32 (1):206-209.
    In lieu of an abstract, here is a brief excerpt of the content:Reviewed by:A Report from the Front Lines: Conversations on Public Theology. A Festschrift in Honor of Robert Benne, and: Explorations in Christian Theology and Ethics: Essays in Conversation with Paul L. LehmannJeffrey P. GreenmanA Report from the Front Lines: Conversations on Public Theology. A Festschrift in Honor of Robert Benne Edited by Michael Shahan Grand Rapids, Mich.: Eerdmans, 2009. 184 pp. $30.00.Explorations in Christian Theology and Ethics: Essays in (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000