Results for ' degree spectra'

1000+ found
Order:
  1.  3
    Degree spectra of relations on a cone.Matthew Harrison-Trainor - 2018 - Providence, RI: American Mathematical Society.
  2.  33
    Degree spectra and computable dimensions in algebraic structures.Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore & Arkadii M. Slinko - 2002 - Annals of Pure and Applied Logic 115 (1-3):71-113.
    Whenever a structure with a particularly interesting computability-theoretic property is found, it is natural to ask whether similar examples can be found within well-known classes of algebraic structures, such as groups, rings, lattices, and so forth. One way to give positive answers to this question is to adapt the original proof to the new setting. However, this can be an unnecessary duplication of effort, and lacks generality. Another method is to code the original structure into a structure in the given (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   52 citations  
  3.  29
    Degree spectra and immunity properties.Barbara F. Csima & Iskander S. Kalimullin - 2010 - Mathematical Logic Quarterly 56 (1):67-77.
    We analyze the degree spectra of structures in which different types of immunity conditions are encoded. In particular, we give an example of a structure whose degree spectrum coincides with the hyperimmune degrees. As a corollary, this shows the existence of an almost computable structure of which the complement of the degree spectrum is uncountable.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  4.  8
    Degree Spectra of Analytic Complete Equivalence Relations.Dino Rossegger - 2022 - Journal of Symbolic Logic 87 (4):1663-1676.
    We study the bi-embeddability and elementary bi-embeddability relation on graphs under Borel reducibility and investigate the degree spectra realized by these relations. We first give a Borel reduction from embeddability on graphs to elementary embeddability on graphs. As a consequence we obtain that elementary bi-embeddability on graphs is a $\boldsymbol {\Sigma }^1_1$ complete equivalence relation. We then investigate the algorithmic properties of this reduction. We obtain that elementary bi-embeddability on the class of computable graphs is $\Sigma ^1_1$ complete (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  12
    New Degree Spectra of Abelian Groups.Alexander G. Melnikov - 2017 - Notre Dame Journal of Formal Logic 58 (4):507-525.
    We show that for every computable ordinal of the form β=δ+2n+1>1, where δ is zero or a limit ordinal and n∈ω, there exists a torsion-free abelian group having an X-computable copy if and only if X is nonlowβ.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  6
    Degree Spectra of Homeomorphism Type of Compact Polish Spaces.Mathieu Hoyrup, Takayuki Kihara & Victor Selivanov - forthcoming - Journal of Symbolic Logic:1-32.
    A Polish space is not always homeomorphic to a computably presented Polish space. In this article, we examine degrees of non-computability of presenting homeomorphic copies of compact Polish spaces. We show that there exists a $\mathbf {0}'$ -computable low $_3$ compact Polish space which is not homeomorphic to a computable one, and that, for any natural number $n\geq 2$, there exists a Polish space $X_n$ such that exactly the high $_{n}$ -degrees are required to present the homeomorphism type of $X_n$. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  7. Degree Spectra of Relations on Computable Structures in the Presence of Δ02 Isomorphisms.Denis R. Hirschfeldt - 2002 - Journal of Symbolic Logic 67 (2):697 - 720.
    We give some new examples of possible degree spectra of invariant relations on Δ 0 2 -categorical computable structures, which demonstrate that such spectra can be fairly complicated. On the other hand, we show that there are nontrivial restrictions on the sets of degrees that can be realized as degree spectra of such relations. In particular, we give a sufficient condition for a relation to have infinite degree spectrum that implies that every invariant computable (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8.  47
    Degree spectra of intrinsically C.e. Relations.Denis R. Hirschfeldt - 2001 - Journal of Symbolic Logic 66 (2):441-469.
    We show that for every c.e. degree a > 0 there exists an intrinsically c.e. relation on the domain of a computable structure whose degree spectrum is {0, a}. This result can be extended in two directions. First we show that for every uniformly c.e. collection of sets S there exists an intrinsically c.e. relation on the domain of a computable structure whose degree spectrum is the set of degrees of elements of S. Then we show that (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  9.  26
    The degree spectra of homogeneous models.Karen Lange - 2008 - Journal of Symbolic Logic 73 (3):1009-1028.
    Much previous study has been done on the degree spectra of prime models of a complete atomic decidable theory. Here we study the analogous questions for homogeneous models. We say a countable model A has a d-basis if the types realized in A are all computable and the Turing degree d can list $\Delta _{0}^{0}$ -indices for all types realized in A. We say A has a d-decidable copy if there exists a model B ≅ A such (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  10.  18
    Uncountable degree spectra.Valentina S. Harizanov - 1991 - Annals of Pure and Applied Logic 54 (3):255-263.
    We consider a recursive model and an additional recursive relation R on its domain, such that there are uncountably many different images of R under isomorphisms from to some recursive model isomorphic to . We study properties of the set of Turing degrees of all these isomorphic images of R on the domain of.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  11.  24
    Degree spectra of relations on structures of finite computable dimension.Denis R. Hirschfeldt - 2002 - Annals of Pure and Applied Logic 115 (1-3):233-277.
    We show that for every computably enumerable degree a > 0 there is an intrinsically c.e. relation on the domain of a computable structure of computable dimension 2 whose degree spectrum is { 0 , a } , thus answering a question of Goncharov and Khoussainov 55–57). We also show that this theorem remains true with α -c.e. in place of c.e. for any α∈ω∪{ω} . A modification of the proof of this result similar to what was done (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  12.  17
    Turing degree spectra of differentially closed fields.David Marker & Russell Miller - 2017 - Journal of Symbolic Logic 82 (1):1-25.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  13.  49
    Degree spectra of relations on computable structures.Denis R. Hirschfeldt - 2000 - Bulletin of Symbolic Logic 6 (2):197-212.
    There has been increasing interest over the last few decades in the study of the effective content of Mathematics. One field whose effective content has been the subject of a large body of work, dating back at least to the early 1960s, is model theory. Several different notions of effectiveness of model-theoretic structures have been investigated. This communication is concerned withcomputablestructures, that is, structures with computable domains whose constants, functions, and relations are uniformly computable.In model theory, we identify isomorphic structures. (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  14.  33
    Degree Spectra of Prime Models.Barbara F. Csima - 2004 - Journal of Symbolic Logic 69 (2):430 - 442.
    We consider the Turing degrees of prime models of complete decidable theories. In particular we show that every complete decidable atomic theory has a prime model whose elementary diagram is low. We combine the construction used in the proof with other constructions to show that complete decidable atomic theories have low prime models with added properties. If we have a complete decidable atomic theory with all types of the theory computable, we show that for every degree d with 0 (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  15.  14
    Degree spectra of real closed fields.Russell Miller & Victor Ocasio González - 2019 - Archive for Mathematical Logic 58 (3-4):387-411.
    Several researchers have recently established that for every Turing degree \, the real closed field of all \-computable real numbers has spectrum \. We investigate the spectra of real closed fields further, focusing first on subfields of the field \ of computable real numbers, then on archimedean real closed fields more generally, and finally on non-archimedean real closed fields. For each noncomputable, computably enumerable set C, we produce a real closed C-computable subfield of \ with no computable copy. (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  16.  44
    Degree spectra of the successor relation of computable linear orderings.Jennifer Chubb, Andrey Frolov & Valentina Harizanov - 2009 - Archive for Mathematical Logic 48 (1):7-13.
    We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turing degrees determined by b is the degree spectrum of the successor relation of some computable linear ordering. This follows from our main result, that for a large class of linear orderings the degree spectrum of the successor relation is closed upward in the c.e. Turing degrees.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  17.  5
    Degree spectra of relations on computable structures in the presence of Δ20 isomorphisms.Denis Hirschfeldt - 2002 - Journal of Symbolic Logic 67 (2):697-720.
  18.  44
    Computable isomorphisms, degree spectra of relations, and Scott families.Bakhadyr Khoussainov & Richard A. Shore - 1998 - Annals of Pure and Applied Logic 93 (1-3):153-193.
    The spectrum of a relation on a computable structure is the set of Turing degrees of the image of R under all isomorphisms between and any other computable structure . The relation is intrinsically computably enumerable if its image under all such isomorphisms is c.e. We prove that any computable partially ordered set is isomorphic to the spectrum of an intrinsically c.e. relation on a computable structure. Moreover, the isomorphism can be constructed in such a way that the image of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  19.  32
    Realizing Levels of the Hyperarithmetic Hierarchy as Degree Spectra of Relations on Computable Structures.Walker M. White & Denis R. Hirschfeldt - 2002 - Notre Dame Journal of Formal Logic 43 (1):51-64.
    We construct a class of relations on computable structures whose degree spectra form natural classes of degrees. Given any computable ordinal and reducibility r stronger than or equal to m-reducibility, we show how to construct a structure with an intrinsically invariant relation whose degree spectrum consists of all nontrivial r-degrees. We extend this construction to show that can be replaced by either or.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  20.  16
    Some effects of Ash–Nerode and other decidability conditions on degree spectra.Valentina S. Harizanov - 1991 - Annals of Pure and Applied Logic 55 (1):51-65.
    With every new recursive relation R on a recursive model , we consider the images of R under all isomorphisms from to other recursive models. We call the set of Turing degrees of these images the degree spectrum of R on , and say that R is intrinsically r.e. if all the images are r.e. C. Ash and A. Nerode introduce an extra decidability condition on , expressed in terms of R. Assuming this decidability condition, they prove that R (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  21.  31
    Spaces of orders and their Turing degree spectra.Malgorzata A. Dabkowska, Mieczyslaw K. Dabkowski, Valentina S. Harizanov & Amir A. Togha - 2010 - Annals of Pure and Applied Logic 161 (9):1134-1143.
    We investigate computability theoretic and topological properties of spaces of orders on computable orderable groups. A left order on a group G is a linear order of the domain of G, which is left-invariant under the group operation. Right orders and bi-orders are defined similarly. In particular, we study groups for which the spaces of left orders are homeomorphic to the Cantor set, and their Turing degree spectra contain certain upper cones of degrees. Our approach unifies and extends (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  22.  13
    Erratum to “computable isomorphisms, degree spectra of relations, and Scott families” [ann. pure appl. logic 93 (1998) 153–193]. [REVIEW]Bakhadyr Khoussainov & Richard A. Shore - 1999 - Annals of Pure and Applied Logic 98 (1-3):297-298.
  23.  58
    $\Pi _{1}^{0}$ Classes and Strong Degree Spectra of Relations.John Chisholm, Jennifer Chubb, Valentina S. Harizanov, Denis R. Hirschfeldt, Carl G. Jockusch, Timothy McNicholl & Sarah Pingrey - 2007 - Journal of Symbolic Logic 72 (3):1003 - 1018.
    We study the weak truth-table and truth-table degrees of the images of subsets of computable structures under isomorphisms between computable structures. In particular, we show that there is a low c.e. set that is not weak truth-table reducible to any initial segment of any scattered computable linear ordering. Countable $\Pi _{1}^{0}$ subsets of 2ω and Kolmogorov complexity play a major role in the proof.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  24.  29
    Computability and uncountable linear orders II: Degree spectra.Noam Greenberg, Asher M. Kach, Steffen Lempp & Daniel D. Turetsky - 2015 - Journal of Symbolic Logic 80 (1):145-178.
  25.  26
    Categoricity Spectra for Polymodal Algebras.Nikolay Bazhenov - 2016 - Studia Logica 104 (6):1083-1097.
    We investigate effective categoricity for polymodal algebras. We prove that the class of polymodal algebras is complete with respect to degree spectra of nontrivial structures, effective dimensions, expansion by constants, and degree spectra of relations. In particular, this implies that every categoricity spectrum is the categoricity spectrum of a polymodal algebra.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  26.  31
    Spectra of Structures and Relations.Valentina S. Harizanov & Russel G. Miller - 2007 - Journal of Symbolic Logic 72 (1):324 - 348.
    We consider embeddings of structures which preserve spectra: if g: M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (as a relation on S). We show that the computable dense linear order L is universal for all countable linear orders under this notion of embedding, and we establish a similar result for the computable random graph G. Such structures are said to be spectrally universal. We use (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  27.  77
    The Spectra of Soundless Voices and Audible Thoughts: Towards an Integrative Model of Auditory Verbal Hallucinations and Thought Insertion.Clara S. Humpston & Matthew R. Broome - 2016 - Review of Philosophy and Psychology 7 (3):611-629.
    Patients with psychotic disorders experience a range of reality distortions. These often include auditory-verbal hallucinations, and thought insertion to a lesser degree; however, their mechanisms and relationships between each other remain largely elusive. Here we attempt to establish a integrative model drawing from the phenomenology of both AVHs and TI and argue that they in fact can be seen as ‘spectra’ of experiences with varying degrees of agency and ownership, with ‘silent and internal own thoughts’ on one extreme (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  28.  32
    Categoricity Spectra for Rigid Structures.Ekaterina Fokina, Andrey Frolov & Iskander Kalimullin - 2016 - Notre Dame Journal of Formal Logic 57 (1):45-57.
    For a computable structure $\mathcal {M}$, the categoricity spectrum is the set of all Turing degrees capable of computing isomorphisms among arbitrary computable copies of $\mathcal {M}$. If the spectrum has a least degree, this degree is called the degree of categoricity of $\mathcal {M}$. In this paper we investigate spectra of categoricity for computable rigid structures. In particular, we give examples of rigid structures without degrees of categoricity.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  29. Bi-embeddability spectra and basis of spectra.Luca San Mauro, Ekaterina Fokina & Dino Rossegger - 2019 - Mathematical Logic Quarterly 2 (65):228-236.
    We study degree spectra of structures with respect to the bi-embeddability relation. The bi-embeddability spectrum of a structure is the family of Turing degrees of its bi-embeddable copies. To facilitate our study we introduce the notions of bi-embeddable triviality and basis of a spectrum. Using bi-embeddable triviality we show that several known families of degrees are bi-embeddability spectra of structures. We then characterize the bi-embeddability spectra of linear orderings and study bases of bi-embeddability spectra of (...)
     
    Export citation  
     
    Bookmark  
  30.  16
    Weak Truth Table Degrees of Structures.David R. Belanger - 2015 - Notre Dame Journal of Formal Logic 56 (2):263-285.
    We study the weak truth table degree spectra of first-order relational structures. We prove a dichotomy among the possible wtt degree spectra along the lines of Knight’s upward-closure theorem for Turing degree spectra. We prove new results contrasting the wtt degree spectra of finite- and infinite-signature structures. We show that, as a method of defining classes of reals, the wtt degree spectrum is, except for some trivial cases, strictly more expressive than (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  31.  27
    The continuous spectra of quantum operators.Boris Leaf - 1982 - Foundations of Physics 12 (6):583-606.
    The linear vector space for the quantum description of a physical system is formulated as the intersection of the domains of Hermiticity of the observables characterizing the system. It is shown that on a continuous interval of its spectrum every Hermitian operator on a Hilbert space of one degree of freedom is a generalized coordinate with a conjugate generalized momentum. Every continuous spectral interval of a Hermitian operator is the limit of a discrete spectrum in the same interval. This (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  32.  5
    Degrees of bi-embeddable categoricity.Luca San Mauro, Nikolay Bazhenov, Ekaterina Fokina & Dino Rossegger - 2021 - Computability 1 (10):1-16.
    We investigate the complexity of embeddings between bi-embeddable structures. In analogy with categoricity spectra, we define the bi-embeddable categoricity spectrum of a structure A as the family of Turing degrees that compute embeddings between any computable bi-embeddable copies of A; the degree of bi-embeddable categoricity of A is the least degree in this spectrum (if it exists). We extend many known results about categoricity spectra to the case of bi-embeddability. In particular, we exhibit structures without (...) of bi-embeddable categoricity, and we show that every degree d.c.e above 0(α) for α a computable successor ordinal and 0(λ) for λ a computable limit ordinal is a degree of bi-embeddable categoricity. We also give examples of families of degrees that are not bi-embeddable categoricity spectra. (shrink)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  33. Relativistic Markovian dynamical collapse theories must employ nonstandard degrees of freedom.Wayne C. Myrvold - 2017 - Physical Review A 96:062116.
    The impossibility of an indeterministic evolution for standard relativistic quantum field theories, that is, theories in which all fields satisfy the condition that the generators of space-time translation have spectra in the forward light-cone, is demonstrated. The demonstration proceeds by arguing that a relativistically invariant theory must have a stable vacuum and then showing that stability of the vacuum, together with the requirements imposed by relativistic causality, entails deterministic evolution, if all degrees of freedom are standard degrees of freedom.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  34.  4
    Yates [1970], who obtained a low minimal degree as a corollary to his con.of Minimal Degrees Below - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press. pp. 81.
    Direct download  
     
    Export citation  
     
    Bookmark  
  35.  22
    Relative to any non-hyperarithmetic set.Noam Greenberg, Antonio Montalbán & Theodore A. Slaman - 2013 - Journal of Mathematical Logic 13 (1):1250007.
    We prove that there is a structure, indeed a linear ordering, whose degree spectrum is the set of all non-hyperarithmetic degrees. We also show that degree spectra can distinguish measure from category.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  36.  25
    Computable Isomorphisms of Boolean Algebras with Operators.Bakhadyr Khoussainov & Tomasz Kowalski - 2012 - Studia Logica 100 (3):481-496.
    In this paper we investigate computable isomorphisms of Boolean algebras with operators (BAOs). We prove that there are examples of polymodal Boolean algebras with finitely many computable isomorphism types. We provide an example of a polymodal BAO such that it has exactly one computable isomorphism type but whose expansions by a constant have more than one computable isomorphism type. We also prove a general result showing that BAOs are complete with respect to the degree spectra of structures, computable (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  37.  3
    Measuring the complexity of reductions between equivalence relations.Luca San Mauro, Ekaterina Fokina & Dino Rossegger - 2019 - Computability 3 (8):265-280.
    Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and bi-reducibility. These spectra provide a natural way of measuring the complexity of reductions between equivalence relations. We prove that any upward closed collection of Turing degrees with a countable basis can be realised as a reducibility spectrum or as a bi-reducibility spectrum. We show also that there (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  38.  31
    Computability of Homogeneous Models.Karen Lange & Robert I. Soare - 2007 - Notre Dame Journal of Formal Logic 48 (1):143-170.
    In the last five years there have been a number of results about the computable content of the prime, saturated, or homogeneous models of a complete decidable theory T in the spirit of Vaught's "Denumerable models of complete theories" combined with computability methods for degrees d ≤ 0′. First we recast older results by Goncharov, Peretyat'kin, and Millar in a more modern framework which we then apply. Then we survey recent results by Lange, "The degree spectra of homogeneous (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  39.  52
    Computability of fraïssé limits.Barbara F. Csima, Valentina S. Harizanov, Russell Miller & Antonio Montalbán - 2011 - Journal of Symbolic Logic 76 (1):66 - 93.
    Fraïssé studied countable structures S through analysis of the age of S i.e., the set of all finitely generated substructures of S. We investigate the effectiveness of his analysis, considering effectively presented lists of finitely generated structures and asking when such a list is the age of a computable structure. We focus particularly on the Fraïssé limit. We also show that degree spectra of relations on a sufficiently nice Fraïssé limit are always upward closed unless the relation is (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  40.  15
    On the effective universality of mereological theories.Nikolay Bazhenov & Hsing-Chien Tsai - 2022 - Mathematical Logic Quarterly 68 (1):48-66.
    Mereological theories are based on the binary relation “being a part of”. The systematic investigations of mereology were initiated by Leśniewski. More recent authors (including Simons, Casati and Varzi, Hovda) formulated a series of first‐order mereological axioms. These axioms give rise to a plenitude of theories, which are of great philosophical interest. The paper considers first‐order mereological theories from the point of view of computable (or effective) algebra. Following the approach of Hirschfeldt, Khoussainov, Shore, and Slinko, we isolate two important (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  41.  11
    The enumeration spectrum hierarchy of n‐families.Marat Faizrahmanov & Iskander Kalimullin - 2016 - Mathematical Logic Quarterly 62 (4-5):420-426.
    We introduce a hierarchy of sets which can be derived from the integers using countable collections. Such families can be coded into countable algebraic structures preserving their algorithmic properties. We prove that for different finite levels of the hierarchy the corresponding algebraic structures have different classes of possible degree spectra.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  42.  43
    Ways of desiring mutual sympathy in Adam Smith's moral philosophy.John McHugh - 2016 - British Journal for the History of Philosophy 24 (4):614-634.
    ABSTRACTIn this paper, I address the question of what we are really after when we seek Smithian mutual sympathy; I also show how the answer I propose can be used to illuminate a crucial feature of Smith's moral philosophy. The first section develops a Smithian response to egoistic interpretations of the desire for mutual sympathy. The second section identifies a number of different self- and other-relevant ways in which one could desire mutual sympathy. Some of these different ways of desiring (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  43.  6
    The Relationship Between Affective Visual Mismatch Negativity and Interpersonal Difficulties Across Autism and Schizotypal Traits.Talitha C. Ford, Laila E. Hugrass & Bradley N. Jack - 2022 - Frontiers in Human Neuroscience 16.
    Sensory deficits are a feature of autism and schizophrenia, as well as the upper end of their non-clinical spectra. The mismatch negativity, an index of pre-attentive auditory processing, is particularly sensitive in detecting such deficits; however, little is known about the relationship between the visual MMN to facial emotions and autism and schizophrenia spectrum symptom domains. We probed the vMMN to happy, sad, and neutral faces in 61 healthy adults, and evaluated their degree of autism and schizophrenia spectrum (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  44. Information as a measure of variation.William Dembski - manuscript
    In many applications of information theory, information measures the reduction of uncertainty that results from the knowledge that an event has occurred. Even so, an item of information learned need not be the occurrence of an event but, rather, the change in probability distribution associated with an ensemble of events. This paper examines the basic account of information, which focuses on events, and reviews how it may be naturally generalized to probability distributions/measures. The resulting information measure is special case of (...)
     
    Export citation  
     
    Bookmark   1 citation  
  45.  35
    The Development of Nonlinear Dynamics in Astronomy.G. Contopoulos - 2001 - Foundations of Physics 31 (1):89-114.
    We present the historical development of Nonlinear Dynamical Astronomy with emphasis on the “third integral” and its applications. The new era started with the use of computers, and of formal analytical developments in the spirit of Poincaré. Most dynamical systems were found to contain both ordered and chaotic orbits. The transition from order to chaos is discussed. Recent developments refer to the dynamical spectra, integrals of notion in self-consistent models, systems of 3 or more degrees of freedom, chaos in (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  46.  22
    Some preliminary formulations toward a new theory of matter.V. Shekhawat - 1976 - Foundations of Physics 6 (2):221-235.
    Matter is pictured as a primitive fluid substratum having the fundamental property of fluctuating at a constant frequency. From this are derived the discrete properties of space and time, and it follows that, at the microlevel, talk of pure space and pure time involves us in ambiguities. A new interpretation of Planck's constant emerges according to which it is a quantum of matter-time combination. Thus, a quantum of matter-space combination should exist. On pursuing further the hydrodynamic model, such a constant (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  47. Burqas in Back Alleys: Street Art, hijab, and the Reterritorialization of Public Space.John A. Sweeney - 2011 - Continent 1 (4):253-278.
    continent. 1.4 (2011): 253—278. A Sense of French Politics Politics itself is not the exercise of power or struggle for power. Politics is first of all the configuration of a space as political, the framing of a specific sphere of experience, the setting of objects posed as "common" and of subjects to whom the capacity is recognized to designate these objects and discuss about them.(1) On April 14, 2011, France implemented its controversial ban of the niqab and burqa , commonly (...)
     
    Export citation  
     
    Bookmark  
  48. Degree supervaluational logic.J. Robert G. Williams - 2011 - Review of Symbolic Logic 4 (1):130-149.
    Supervaluationism is often described as the most popular semantic treatment of indeterminacy. There’s little consensus, however, about how to fill out the bare-bones idea to include a characterization of logical consequence. The paper explores one methodology for choosing between the logics: pick a logic thatnorms beliefas classical consequence is standardly thought to do. The main focus of the paper considers a variant of standard supervaluational, on which we can characterizedegrees of determinacy. It applies the methodology above to focus ondegree logic. (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  49.  9
    Purity, spectra and localisation.Mike Prest - 2009 - New York: Cambridge University Press.
    The central aim of this book is to understand modules and the categories they form through associated structures and dimensions, which reflect the complexity of these, and similar, categories.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  50. Degrees of Epistemic Criticizability.Cameron Boult - 2024 - Philosophical Quarterly 74 (2):431-452.
    We regularly make graded normative judgements in the epistemic domain. Recent work in the literature examines degrees of justification, degrees of rationality, and degrees of assertability. This paper addresses a different dimension of the gradeability of epistemic normativity, one that has been given little attention. How should we understand degrees of epistemic criticizability? In virtue of what sorts of factors can one epistemic failing be worse than another? The paper develops a dual-factor view of degrees of epistemic criticizability. According to (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000