Results for 'hyper‐simple set'

969 found
Order:
  1. Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond. Third volume.Florentin Smarandache - 2024
    The third volume of “Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond” presents an in-depth exploration of the cutting-edge developments in uncertain combinatorics and set theory. This comprehensive collection highlights innovative methodologies such as graphization, hyperization, and uncertainization, which enhance combinatorics by incorporating foundational concepts from fuzzy, neutrosophic, soft, and rough set theories. These advancements open new mathematical horizons, offering novel approaches to managing uncertainty within complex systems. Combinatorics, a discipline focused on counting, arrangement, (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  2.  22
    Post's Problem for Reducibilities of Bounded Complexity.Valeriy K. Bulitko - 2002 - Mathematical Logic Quarterly 48 (3):367-373.
    In this paper we consider the we known method by E. Post of solving the problem of construction of recursively enumerable sets that have a degree intermediate between the degrees of recursive and complete sets with respect to a given reducibility. Post considered reducibilities ≤m, ≤btt, ≤tt and ≤T and solved the problem for al of them except ≤T. Here we extend Post's original method of construction of incomplete sets onto two wide classes of sub-Turing reducibilities what were studying in (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  3.  57
    Two simple sets that are not positively Borel.Wim Veldman - 2005 - Annals of Pure and Applied Logic 135 (1-3):151-209.
    The author proved in his Ph.D. Thesis [W. Veldman, Investigations in intuitionistic hierarchy theory, Ph.D. Thesis, Katholieke Universiteit Nijmegen, 1981] that, in intuitionistic analysis, the positively Borel subsets of Baire space form a genuinely growing hierarchy: every level of the hierarchy contains sets that do not occur at any lower level. It follows from this result that there are natural examples of analytic and also of co-analytic sets that are not positively Borel. It turns out, however, that, in intuitionistic analysis, (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  4.  42
    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 can be split into (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  5. Psychosis and autism as diametrical disorders of the social brain.Bernard Crespi & Christopher Badcock - 2008 - Behavioral and Brain Sciences 31 (3):241-261.
    Autistic-spectrum conditions and psychotic-spectrum conditions (mainly schizophrenia, bipolar disorder, and major depression) represent two major suites of disorders of human cognition, affect, and behavior that involve altered development and function of the social brain. We describe evidence that a large set of phenotypic traits exhibit diametrically opposite phenotypes in autistic-spectrum versus psychotic-spectrum conditions, with a focus on schizophrenia. This suite of traits is inter-correlated, in that autism involves a general pattern of constrained overgrowth, whereas schizophrenia involves undergrowth. These disorders also (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   34 citations  
  6. Nowhere simple sets and the lattice of recursively enumerable sets.Richard A. Shore - 1978 - Journal of Symbolic Logic 43 (2):322-330.
  7.  65
    Countable unions of simple sets in the core model.P. D. Welch - 1996 - Journal of Symbolic Logic 61 (1):293-312.
    We follow [8] in asking when a set of ordinals $X \subseteq \alpha$ is a countable union of sets in K, the core model. We show that, analogously to L, and X closed under the canonical Σ 1 Skolem function for K α can be so decomposed provided K is such that no ω-closed filters are put on its measure sequence, but not otherwise. This proviso holds if there is no inner model of a weak Erdős-type property.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  8.  40
    Effectively nowhere simple sets.D. Miller & J. B. Remmel - 1984 - Journal of Symbolic Logic 49 (1):129-136.
  9.  52
    The dense simple sets are orbit complete with respect to the simple sets.Peter Cholak - 1998 - Annals of Pure and Applied Logic 94 (1-3):37-44.
    We prove conjectures of Herrmann and Stob by showing that the dense simple sets are orbit complete w.r.t. the simple sets.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  12
    Incompleteness via simple sets.Erik Ellentuck - 1971 - Notre Dame Journal of Formal Logic 12 (2):255-256.
  11.  36
    Donald A. Martin. A theorem on hyper hypersimple sets. The journal of symbolic logic, vol. 28 no. 4 , pp. 273–278.Marian Boykan Pour-El - 1966 - Journal of Symbolic Logic 31 (1):139-139.
  12. The Simple Consistency of Naive Set Theory using Metavaluations.Ross T. Brady - 2014 - Journal of Philosophical Logic 43 (2-3):261-281.
    The main aim is to extend the range of logics which solve the set-theoretic paradoxes, over and above what was achieved by earlier work in the area. In doing this, the paper also provides a link between metacomplete logics and those that solve the paradoxes, by finally establishing that all M1-metacomplete logics can be used as a basis for naive set theory. In doing so, we manage to reach logics that are very close in their axiomatization to that of the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  13.  38
    Variations on promptly simple sets.Wolfgang Maass - 1985 - Journal of Symbolic Logic 50 (1):138-148.
  14.  20
    The concept of $n$-cylinder and its relationship to simple sets.M. B. Thuraisingham - 1983 - Notre Dame Journal of Formal Logic 24 (3):328-336.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  15.  38
    Simple characterization of functionally complete one‐element sets of propositional connectives.Petar Maksimović & Predrag Janičić - 2006 - Mathematical Logic Quarterly 52 (5):498-504.
    A set of propositional connectives is said to be functionally complete if all propositional formulae can be expressed using only connectives from that set. In this paper we give sufficient and necessary conditions for a one-element set of propositional connectives to be functionally complete. These conditions provide a simple and elegant characterization of functionally complete one-element sets of propositional connectives.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16. 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  
  17.  15
    Invariant Constructions of Simple and Maximal Sets.Frank P. Weber - 1995 - Mathematical Logic Quarterly 41 (2):143-160.
    The main results of the present paper are the following theorems: 1. There is no e ∈ ω such that for any A, B ⊆ ω, SA = Wmath image is simple in A, and if A′ [TRIPLE BOND]TB′, then SA =* SB. 2 There is an e ∈ ω such that for any A, B ⊆ ω, MA = We is incomplete maximal in A, and if A =* B, then MA [TRIPLE BOND]TMB.
    Direct download  
     
    Export citation  
     
    Bookmark  
  18.  73
    A simple approach towards recapturing consistent theories in paraconsistent settings.Jc Beall - 2013 - Review of Symbolic Logic 6 (4):755-764.
    I believe that, for reasons elaborated elsewhere (Beall, 2009; Priest, 2006a, 2006b), the logic LP (Asenjo, 1966; Asenjo & Tamburino, 1975; Priest, 1979) is roughly right as far as logic goes.1 But logic cannot go everywhere; we need to provide nonlogical axioms to specify our (axiomatic) theories. This is uncontroversial, but it has also been the source of discomfort for LP-based theorists, particularly with respect to true mathematical theories which we take to be consistent. My example, throughout, is arithmetic; but (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  19.  66
    The simple consistency of a set theory based on the logic ${\rm CSQ}$.Ross T. Brady - 1983 - Notre Dame Journal of Formal Logic 24 (4):431-449.
  20.  15
    On the strongly bounded turing degrees of simple sets.Klaus Ambos-Spies - 2014 - In On the strongly bounded turing degrees of simple sets. pp. 23-78.
  21.  28
    Soare Robert I.. Automorphisms of the lattice of recursively enumerable sets. Part I: maximal sets. Annals of mathematics, ser. 2 vol. 100 , pp. 80–120. - Lerman Manuel and Soare Robert I.. d-Simple sets, small sets, and degree classes. Pacific journal of mathematics, vol. 87 , pp. 135–155. - Cholak Peter. Automorphisms of the lattice of recursively enumerable sets. Memoirs of the American Mathematical Society, no. 541. American Mathematical Society, Providence1995, viii + 151 pp. - Harrington Leo and Soare Robert I.. The Δ30-automorphism method and noninvariant classes of degrees. Journal of the American Mathematical Society, vol. 9 , pp. 617–666. [REVIEW]Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
  22. Hyper-Extending the Mind?: Setting Boundaries in the Special Sciences.Carl Gillett - 2007 - Philosophical Topics 35 (1-2):161-188.
  23.  38
    The right set of simple rules: A short reply to Frederick Schauer and comment on G. A. Cohen.Richard A. Epstein - 1998 - Critical Review: A Journal of Politics and Society 12 (3):305-318.
    In Simple Rules for a Complex World, I outlined a set of legal rules that facilitate just and efficient social interactions among individuals. Frederick Schauer's critique of my book ignores the specific implications of my system in favor of a general critique of simplicity that overlooks the dangers to liberty when complex rules confer vast discretion on public figures. He also does not refer to the nonlibertarian features of my system that allow for overcoming holdout positions. These “take and pay” (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  24.  40
    Cuppability of Simple and Hypersimple Sets.Martin Kummer & Marcus Schaefer - 2007 - Notre Dame Journal of Formal Logic 48 (3):349-369.
    An incomplete degree is cuppable if it can be joined by an incomplete degree to a complete degree. For sets fulfilling some type of simplicity property one can now ask whether these sets are cuppable with respect to a certain type of reducibilities. Several such results are known. In this paper we settle all the remaining cases for the standard notions of simplicity and all the main strong reducibilities.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  25.  14
    Learning sets for simple concept identification and reversal shifts.Lorraine A. Low, Frederick Gronberg & Bernice Sherling - 1975 - Bulletin of the Psychonomic Society 5 (3):254-256.
  26. Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond. Fourth volume: HyperUncertain Set (Collected Papers).Fujita Takaaki & Florentin Smarandache - 2025 - Gallup, NM, USA: NSIA Publishing House.
    This book represents the fourth volume in the series Collected Papers on Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond. This volume specifically delves into the concept of the HyperUncertain Set, building on the foundational advancements introduced in previous volumes. The series aims to explore the ongoing evolution of uncertain combinatorics through innovative methodologies such as graphization, hyperization, and uncertainization. These approaches integrate and extend core concepts from fuzzy, neutrosophic, soft, and rough set theories, (...)
     
    Export citation  
     
    Bookmark  
  27. Hyper-contradictions, generalized truth values and logics of truth and falsehood.Yaroslav Shramko & Heinrich Wansing - 2006 - Journal of Logic, Language and Information 15 (4):403-424.
    In Philosophical Logic, the Liar Paradox has been used to motivate the introduction of both truth value gaps and truth value gluts. Moreover, in the light of “revenge Liar” arguments, also higher-order combinations of generalized truth values have been suggested to account for so-called hyper-contradictions. In the present paper, Graham Priest's treatment of generalized truth values is scrutinized and compared with another strategy of generalizing the set of classical truth values and defining an entailment relation on the resulting sets of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   30 citations  
  28. A Hyper-Relation Characterization of Weak Pseudo-Rationalizability.Rush T. Stewart - 2020 - Journal of Mathematical Psychology 99:1-5.
    I provide a characterization of weakly pseudo-rationalizable choice functions---that is, choice functions rationalizable by a set of acyclic relations---in terms of hyper-relations satisfying certain properties. For those hyper-relations Nehring calls extended preference relations, the central characterizing condition is weaker than (hyper-relation) transitivity but stronger than (hyper-relation) acyclicity. Furthermore, the relevant type of hyper-relation can be represented as the intersection of a certain class of its extensions. These results generalize known, analogous results for path independent choice functions.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  29.  6
    TIMBREis a misleadingly simple and vague word encompassing a very complex set of auditory attributes, as well as a plethora of psychological and musical issues. It covers.Stephen McAdams & Bruno L. Giordano - 2008 - In Susan Hallam, Ian Cross & Michael Thaut (eds.), Oxford Handbook of Music Psychology. Oxford University Press.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  30.  59
    Hyper-Slingshot. Is Fact-Arithmetic Possible?Wojciech Krysztofiak - 2015 - Foundations of Science 20 (1):59-76.
    The paper presents a new argument supporting the ontological standpoint according to which there are no mathematical facts in any set theoretic model of arithmetical theories. It may be interpreted as showing that it is impossible to construct fact-arithmetic. The importance of this conclusion arises in the context of cognitive science. In the paper, a new type of slingshot argument is presented, which is called hyper-slingshot. The difference between meta-theoretical hyper-slingshots and conventional slingshots consists in the fact that the former (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  31.  41
    Keeping it simple: studying grammatical encoding with lexically reduced item sets.Alma Veenstra, Daniel J. Acheson & Antje S. Meyer - 2014 - Frontiers in Psychology 5.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  32.  40
    Types of simple α-recursively enumerable sets.Manuel Lerman - 1976 - Journal of Symbolic Logic 41 (2):419-426.
  33. A Simple Logic of Functional Dependence.Alexandru Baltag & Johan van Benthem - 2021 - Journal of Philosophical Logic 50 (5):939-1005.
    This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized assignment semantics for first order logic. The expressive strength, complete proof calculus and meta-properties of LFD are explored. Various language extensions are presented as well, up to undecidable modal-style logics for independence and dynamic logics of changing dependence models. Finally, more concrete settings for dependence are discussed: continuous (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  34.  8
    Simple Tableaus for Simple Logics.Melvin Fitting - 2024 - Notre Dame Journal of Formal Logic 65 (3):275-309.
    Consider those many-valued logic models in which the truth values are a lattice that supplies interpretations for the logical connectives of conjunction and disjunction, and which has a De Morgan involution supplying an interpretation for negation. Assume that the set of designated truth values is a prime filter in the lattice. Each of these structures determines a simple many-valued logic. We show that there is a single Smullyan-style signed tableau system appropriate for all of the logics these structures determine. Differences (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  35.  26
    On the category of hyper MV‐algebras.Shokoofeh Ghorbani, Esfandiar Eslami & Abbas Hasankhani - 2009 - Mathematical Logic Quarterly 55 (1):21-30.
    In this paper we study the category of hyper MV-algebras and we prove that it has a terminal object and a coequalizer. We show that Jia's construction can be modified to provide a free hyper MV-algebra by a set. We use this to show that in the category of hyper MV-algebras the monomorphisms are exactly the one-to-one homomorphisms.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  36.  51
    A Set Theoretic Approach to the Simple Theory of Types.Michael D. Resnik - 1969 - Theoria 35 (3):239-258.
  37. A splitting theorem for simple π11 sets.James C. Owings - 1971 - Journal of Symbolic Logic 36 (3):433 - 438.
  38. Simple Consequence Relations.Arnon Avron - unknown
    We provide a general investigation of Logic in which the notion of a simple consequence relation is taken to be fundamental. Our notion is more general than the usual one since we give up monotonicity and use multisets rather than sets. We use our notion for characterizing several known logics (including Linear Logic and non-monotonic logics) and for a general, semantics-independent classi cation of standard connectives via equations on consequence relations (these include Girard's \multiplicatives" and \additives"). We next investigate the (...)
     
    Export citation  
     
    Bookmark   52 citations  
  39.  54
    Hyper-Torre isols.Erik Ellentuck - 1981 - Journal of Symbolic Logic 46 (1):1-5.
    If T is an isol let D(T) be the least set of isols which contains T and is closed under predecessors and the application of almost recursive combinatorial functions. We find an infinite regressive isol T such that the universal theory (with respect to recursive relations and almost recursive combinatorial functions) of D(T) is the same as that of the nonnegative integers.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  40.  13
    Life is simple: how Occam's razor set science free and shapes the universe.Johnjoe McFadden - 2021 - New York: Basic Books.
    Centuries ago, the principle of Occam's razor changed our world by showing simpler answers to be preferable and more often true. In Life Is Simple, scientist Johnjoe McFadden traces centuries of discoveries, taking us from a geocentric cosmos to quantum mechanics and DNA, arguing that simplicity has revealed profound answers to the greatest mysteries. This is no coincidence. From the laws that keep a ball in motion to those that govern evolution, simplicity, he claims, has shaped the universe itself. And (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  41.  69
    The simple substitution property of gödel's intermediate propositional logics sn's.Katsumi Sasaki - 1990 - Studia Logica 49 (4):471 - 481.
    The simple substitution property provides a systematic and easy method for proving a theorem from the additional axioms of intermediate prepositional logics. There have been known only four intermediate logics that have the additional axioms with the property. In this paper, we reformulate the many valued logics S' n defined in Gödel [3] and prove the simple substitution property for them. In our former paper [9], we proved that the sets of axioms composed of one prepositional variable do not have (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  42.  48
    Types of simple α-recursively enumerable sets.Anne Leggett & Richard A. Shore - 1976 - Journal of Symbolic Logic 41 (3):681-694.
  43.  35
    Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets.Andrej Muchnik & Alexei Semenov - 2006 - Annals of Pure and Applied Logic 141 (3):437-441.
    Let μ be a universal lower enumerable semi-measure . Any computable upper bound for μ can be effectively separated from zero with a constant . Computable positive lower bounds for μ can be nontrivial and allow one to construct natural examples of hypersimple sets.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  44.  22
    Difference sets and computability theory.Rod Downey, Zoltán Füredi, Carl G. Jockusch & Lee A. Rubel - 1998 - Annals of Pure and Applied Logic 93 (1-3):63-72.
    For a set A of non-negative integers, let D be the set of non-negative differences of elements of A. Clearly, if A is computable, then D is computably enumerable. We show that every simple set which contains 0 is the difference set of some computable set and that every computably enumerable set is computably isomorphic to the difference set of some computable set. Also, we prove that there is a computable set which is the difference set of the complement of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  45.  71
    Simple Concepts.Pavel Materna - 2013 - Acta Analytica 28 (3):295-319.
    To talk about simple concepts presupposes that the notion of concept has been aptly explicated. I argue that a most adequate explication should abandon the set-theoretical paradigm and use a procedural approach. Such a procedural approach is offered by Tichý´s Transparent Intensional Logic (TIL). Some main notions and principles of TIL are briefly presented, and as a result, concepts are explicated as a kind of abstract procedure. Then it can be shown that simplicity, as applied to concepts, is well definable (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  46.  74
    HYPER-REF: A General Model of Reference for First-Order Logic and First-Order Arithmetic.Pablo Rivas-Robledo - 2022 - Kriterion – Journal of Philosophy 36 (2):179-205.
    In this article I present HYPER-REF, a model to determine the referent of any given expression in First-Order Logic. I also explain how this model can be used to determine the referent of a first-order theory such as First-Order Arithmetic. By reference or referent I mean the non-empty set of objects that the syntactical terms of a well-formed formula pick out given a particular interpretation of the language. To do so, I will first draw on previous work to make explicit (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  47.  50
    Why do people fail to see simple solutions? Using think-aloud protocols to uncover the mechanism behind the Einstellung (mental set) effect.Christine Blech, Robert Gaschler & Merim Bilalić - 2019 - Thinking and Reasoning 26 (4):552-580.
    Einstellung effects designate the phenomenon where established routines can prevent people from finding other, possibly more efficient solutions. Here we investigate the mechanism behi...
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  48. Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
    We show that one can solve Post's Problem by constructing generic sets in the usual set theoretic framework applied to tiny universes. This method leads to a new class of recursively enumerable sets: r.e. generic sets. All r.e. generic sets are low and simple and therefore of Turing degree strictly between 0 and 0'. Further they supply the first example of a class of low recursively enumerable sets which are automorphic in the lattice E of recursively enumerable sets with inclusion. (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  49.  10
    Assessing human reaction to a virtual agent’s facial feedback in a simple Q&A setting.Reza Moradinezhad & Erin Solovey - 2018 - Frontiers in Human Neuroscience 12.
  50.  12
    On Some Complexity Characteristics of Immune Sets.Valeriy K. Bulitko - 1995 - Mathematical Logic Quarterly 41 (3):307-313.
    We suggest some new ways to effectivize the definitions of several classes of simple sets. On this basis, new completeness criterions for simple sets are obtained. In particular, we give descriptions of the class of complete maximal sets.
    Direct download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 969