Results for 'Andr�� Nies'

138 found
Order:
  1.  6
    The Confusions of Fitness.AndrÉ Ariew - 2004 - British Journal for the Philosophy of Science 55 (2):347-363.
  2.  49
    Describing Groups.André Nies - 2007 - Bulletin of Symbolic Logic 13 (3):305-339.
    Two ways of describing a group are considered. 1. A group is finite-automaton presentable if its elements can be represented by strings over a finite alphabet, in such a way that the set of representing strings and the group operation can be recognized by finite automata. 2. An infinite f.g. group is quasi-finitely axiomatizable if there is a description consisting of a single first-order sentence, together with the information that the group is finitely generated. In the first part of the (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  3.  65
    Externalism and Skepticism.Andr Gallois - 1996 - Philosophical Studies 81 (1):1-26.
  4.  30
    ?November 4, 1995: Deleuze's Death as an Event? [REVIEW]Andr� Pierre Colombat - 1996 - Man and World 29 (3):235-249.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  5.  61
    Randomness, Relativization and Turing Degrees.André Nies, Frank Stephan & Sebastiaan A. Terwijn - 2005 - Journal of Symbolic Logic 70 (2):515-535.
    We compare various notions of algorithmic randomness. First we consider relativized randomness. A set is n-random if it is Martin-Löf random relative to ∅. We show that a set is 2-random if and only if there is a constant c such that infinitely many initial segments x of the set are c-incompressible: C ≥ |x|-c. The ‘only if' direction was obtained independently by Joseph Miller. This characterization can be extended to the case of time-bounded C-complexity. Next we prove some results (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  6.  23
    Parameter Definability in the Recursively Enumerable Degrees.André Nies - 2003 - Journal of Mathematical Logic 3 (01):37-65.
    The biinterpretability conjecture for the r.e. degrees asks whether, for each sufficiently large k, the [Formula: see text] relations on the r.e. degrees are uniformly definable from parameters. We solve a weaker version: for each k ≥ 7, the [Formula: see text] relations bounded from below by a nonzero degree are uniformly definable. As applications, we show that Low 1 is parameter definable, and we provide methods that lead to a new example of a ∅-definable ideal. Moreover, we prove that (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  7. Definability in the Recursively Enumerable Degrees.André Nies, Richard A. Shore & Theodore A. Slaman - 1996 - Bulletin of Symbolic Logic 2 (4):392-404.
  8.  8
    A New Spectrum of Recursive Models.André Nies - 1999 - Notre Dame Journal of Formal Logic 40 (3):307-314.
    We describe a strongly minimal theory S in an effective language such that, in the chain of countable models of S, only the second model has a computable presentation. Thus there is a spectrum of an -categorical theory which is neither upward nor downward closed. We also give an upper bound on the complexity of spectra.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  9.  20
    Recursively Enumerable Equivalence Relations Modulo Finite Differences.André Nies - 1994 - Mathematical Logic Quarterly 40 (4):490-518.
    We investigate the upper semilattice Eq* of recursively enumerable equivalence relations modulo finite differences. Several natural subclasses are shown to be first-order definable in Eq*. Building on this we define a copy of the structure of recursively enumerable many-one degrees in Eq*, thereby showing that Th has the same computational complexity as the true first-order arithmetic.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  10.  8
    Computably Enumerable Sets Below Random Sets.André Nies - 2012 - Annals of Pure and Applied Logic 163 (11):1596-1610.
    We use Demuth randomness to study strong lowness properties of computably enumerable sets, and sometimes of Δ20 sets. A set A⊆N is called a base for Demuth randomness if some set Y Turing above A is Demuth random relative to A. We show that there is an incomputable, computably enumerable base for Demuth randomness, and that each base for Demuth randomness is strongly jump-traceable. We obtain new proofs that each computably enumerable set below all superlow Martin-Löf random sets is strongly (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  11.  39
    Mystery, Mind, and Materialism.Andr Kukla - 1995 - Philosophical Psychology 8 (3):255-64.
    McGinn claims that there is nothing “inherently mysterious” about consciousness, even though we will never be able to understand it. The first claim is no more than a rhetorical flourish. The second may be read either as a claim that we are unable to construct an explanatory theory of consciousness, or that any such theory must strike us as unintelligible, in the sense in which quantum mechanics is sometimes said to be unintelligible. On the first reading, McGinn's argument is based (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  12.  16
    Finite Automata Presentable Abelian Groups.André Nies & Pavel Semukhin - 2010 - Annals of Pure and Applied Logic 161 (3):458-467.
    We give new examples of FA presentable torsion-free abelian groups. Namely, for every n2, we construct a rank n indecomposable torsion-free abelian group which has an FA presentation. We also construct an FA presentation of the group in which every nontrivial cyclic subgroup is not FA recognizable.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  13.  13
    Between Religion and Philosophy: The Function of Allegory in the Derveni Papyrus.Laks Andrƒ - 1997 - Phronesis 42 (2):2.
  14. Structural Properties and Σ20 Enumeration Degrees.André Nies & Andrea Sorbi - 2000 - Journal of Symbolic Logic 65 (1):285-292.
    We prove that each Σ 0 2 set which is hypersimple relative to $\emptyset$ ' is noncuppable in the structure of the Σ 0 2 enumeration degrees. This gives a connection between properties of Σ 0 2 sets under inclusion and and the Σ 0 2 enumeration degrees. We also prove that some low non-computably enumerable enumeration degree contains no set which is simple relative to $\emptyset$ '.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  15.  4
    Langford and Ramachandran on Occasional Identities.AndrÉ Gallois - 2001 - Philosophical Quarterly 51 (204):378-385.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  16.  46
    Randomness and Computability: Open Questions.Joseph S. Miller & André Nies - 2006 - Bulletin of Symbolic Logic 12 (3):390-410.
  17.  15
    Interpreting N in the Computably Enumerable Weak Truth Table Degrees.André Nies - 2001 - Annals of Pure and Applied Logic 107 (1-3):35-48.
    We give a first-order coding without parameters of a copy of in the computably enumerable weak truth table degrees. As a tool, we develop a theory of parameter definable subsets.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  18.  26
    Computable Models of Theories with Few Models.Bakhadyr Khoussainov, Andre Nies & Richard A. Shore - 1997 - Notre Dame Journal of Formal Logic 38 (2):165-178.
    In this paper we investigate computable models of -categorical theories and Ehrenfeucht theories. For instance, we give an example of an -categorical but not -categorical theory such that all the countable models of except its prime model have computable presentations. We also show that there exists an -categorical but not -categorical theory such that all the countable models of except the saturated model, have computable presentations.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  19.  8
    Interpreting True Arithmetic in the Theory of the R.E. Truth Table Degrees.André Nies & Richard A. Shore - 1995 - Annals of Pure and Applied Logic 75 (3):269-311.
    We show that the elementary theory of the recursively enumerable tt-degrees has the same computational complexity as true first-order arithmetic. As auxiliary results, we prove theorems about exact pairs and initial segments in the tt-degrees.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  20.  30
    Lowness Properties and Approximations of the Jump.Santiago Figueira, André Nies & Frank Stephan - 2008 - Annals of Pure and Applied Logic 152 (1):51-66.
    We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-lowness for sets of natural numbers. A computable non-decreasing unbounded function h is called an order function. Informally, a set A is strongly jump-traceable if for each order function h, for each input e one may effectively enumerate a set Te of possible values for the jump JA, and the number of values enumerated is at most h. A′ (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  21.  33
    Demuth Randomness and Computational Complexity.Antonín Kučera & André Nies - 2011 - Annals of Pure and Applied Logic 162 (7):504-513.
    Demuth tests generalize Martin-Löf tests in that one can exchange the m-th component a computably bounded number of times. A set fails a Demuth test if Z is in infinitely many final versions of the Gm. If we only allow Demuth tests such that GmGm+1 for each m, we have weak Demuth randomness.We show that a weakly Demuth random set can be high and , yet not superhigh. Next, any c.e. set Turing below a Demuth random set is strongly jump-traceable.We (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  22.  32
    Benign Cost Functions and Lowness Properties.Noam Greenberg & André Nies - 2011 - Journal of Symbolic Logic 76 (1):289 - 312.
    We show that the class of strongly jump-traceable c.e. sets can be characterised as those which have sufficiently slow enumerations so they obey a class of well-behaved cost functions, called benign. This characterisation implies the containment of the class of strongly jump-traceable c.e. Turing degrees in a number of lowness classes, in particular the classes of the degrees which lie below incomplete random degrees, indeed all LR-hard random degrees, and all ω-c.e. random degrees. The last result implies recent results of (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  23.  8
    What You Don't Know Doesn't Hurt You.Andr? Gombay - 1979 - Proceedings of the Aristotelian Society 79:239 - 249.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  24.  71
    Lowness and Π₂⁰ Nullsets.Rod Downey, Andre Nies, Rebecca Weber & Liang Yu - 2006 - Journal of Symbolic Logic 71 (3):1044-1052.
    We prove that there exists a noncomputable c.e. real which is low for weak 2-randomness, a definition of randomness due to Kurtz, and that all reals which are low for weak 2-randomness are low for Martin-Löf randomness.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  25.  38
    The Theory of the Recursively Enumerable Weak Truth-Table Degrees is Undecidable.Klaus Ambos-Spies, André Nies & Richard A. Shore - 1992 - Journal of Symbolic Logic 57 (3):864-874.
    We show that the partial order of Σ0 3-sets under inclusion is elementarily definable with parameters in the semilattice of r.e. wtt-degrees. Using a result of E. Herrmann, we can deduce that this semilattice has an undecidable theory, thereby solving an open problem of P. Odifreddi.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  26.  5
    Effects of Probable Outcome Information on Two-Choice Learning.Richard C. Nies - 1962 - Journal of Experimental Psychology 64 (5):430.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  27.  12
    Computably Enumerable Sets and Quasi-Reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.
    We consider the computably enumerable sets under the relation of Q-reducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, Q, under this reducibility with the more familiar structure of the c.e. Turing degrees. In our final section, we use coding methods to show that the elementary theory of RQ, Q is undecidable.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  28.  65
    Calibrating Randomness.Rod Downey, Denis R. Hirschfeldt, André Nies & Sebastiaan A. Terwijn - 2006 - Bulletin of Symbolic Logic 12 (3):411-491.
    We report on some recent work centered on attempts to understand when one set is more random than another. We look at various methods of calibration by initial segment complexity, such as those introduced by Solovay [125], Downey, Hirschfeldt, and Nies [39], Downey, Hirschfeldt, and LaForte [36], and Downey [31]; as well as other methods such as lowness notions of Kučera and Terwijn [71], Terwijn and Zambella [133], Nies [101, 100], and Downey, Griffiths, and Reid [34]; higher level (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   28 citations  
  29.  17
    Demuth’s Path to Randomness.Antonín Kučera, André Nies & Christopher P. Porter - 2015 - Bulletin of Symbolic Logic 21 (3):270-305.
    Osvald Demuth studied constructive analysis from the viewpoint of the Russian school of constructive mathematics. In the course of his work he introduced various notions of effective null set which, when phrased in classical language, yield a number of major algorithmic randomness notions. In addition, he proved several results connecting constructive analysis and randomness that were rediscovered only much later.In this paper, we trace the path that took Demuth from his constructivist roots to his deep and innovative work on the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  30. Higher Kurtz Randomness.Bjørn Kjos-Hanssen, André Nies, Frank Stephan & Liang Yu - 2010 - Annals of Pure and Applied Logic 161 (10):1280-1290.
    A real x is -Kurtz random if it is in no closed null set . We show that there is a cone of -Kurtz random hyperdegrees. We characterize lowness for -Kurtz randomness as being -dominated and -semi-traceable.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  31.  33
    Upper Bounds on Ideals in the Computably Enumerable Turing Degrees.George Barmpalias & André Nies - 2011 - Annals of Pure and Applied Logic 162 (6):465-473.
    We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper ideal in the c.e. Turing degrees has an incomplete upper bound. It follows that there is no prime ideal in the c.e. Turing degrees. This answers a question of Calhoun [2]. Every proper ideal in the c.e. Turing degrees has a low2 upper bound. Furthermore, the partial order of ideals under inclusion is dense.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  32. Program Size Complexity for Possibly Infinite Computations.Verónica Becher, Santiago Figueira, André Nies & Silvana Picchi - 2005 - Notre Dame Journal of Formal Logic 46 (1):51-64.
    We define a program size complexity function $H^\infty$ as a variant of the prefix-free Kolmogorov complexity, based on Turing monotone machines performing possibly unending computations. We consider definitions of randomness and triviality for sequences in ${\{0,1\}}^\omega$ relative to the $H^\infty$ complexity. We prove that the classes of Martin-Löf random sequences and $H^\infty$-random sequences coincide and that the $H^\infty$-trivial sequences are exactly the recursive ones. We also study some properties of $H^\infty$ and compare it with other complexity functions. In particular, $H^\infty$ (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  33.  37
    Superhighness.Bjørn Kjos-Hanssen & Andrée Nies - 2009 - Notre Dame Journal of Formal Logic 50 (4):445-452.
    We prove that superhigh sets can be jump traceable, answering a question of Cole and Simpson. On the other hand, we show that such sets cannot be weakly 2-random. We also study the class $superhigh^\diamond$ and show that it contains some, but not all, of the noncomputable K-trivial sets.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  34.  42
    The Undecidability of the II4 Theory for the R. E. Wtt and Turing Degrees.Steffen Lempp & André Nies - 1995 - Journal of Symbolic Logic 60 (4):1118 - 1136.
    We show that the Π 4 -theory of the partial order of recursively enumerable weak truth-table degrees is undecidable, and give a new proof of the similar fact for r.e. T-degrees. This is accomplished by introducing a new coding scheme which consists in defining the class of finite bipartite graphs with parameters.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  35.  38
    The Undecidability of the II$^_4$ Theory for the R. E. Wtt and Turing Degrees.Steffen Lempp & André Nies - 1995 - Journal of Symbolic Logic 60 (4):1118-1136.
    We show that the $\Pi_4$-theory of the partial order of recursively enumerable weak truth-table degrees is undecidable, and give a new proof of the similar fact for r.e. T-degrees. This is accomplished by introducing a new coding scheme which consists in defining the class of finite bipartite graphs with parameters.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  36.  3
    A Republican Interpretation of the Late Rawls.AndrÉ de Francisco - 2006 - Journal of Political Philosophy 14 (3):270-288.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  37.  14
    Cappable Recursively Enumerable Degrees and Post's Program.Klaus Ambos-Spies & André Nies - 1992 - Archive for Mathematical Logic 32 (1):51-56.
    We give a simple structural property which characterizes the r.e. sets whose (Turing) degrees are cappable. Since cappable degrees are incomplete, this may be viewed as a solution of Post's program, which asks for a simple structural property of nonrecursive r.e. sets which ensures incompleteness.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  38. Popular Movements in Sweden : Report on a Mass-Data Research Project.Carl Göran Andræ - 1969 - Social Science Information 8 (1):65-75.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  39.  10
    Comments.Andr� Beteille, Asa Briggs, Hans Daalder, Mich�le Gendreau-Massaloux, Patricia Albjerg Graham, Heinz Maier-Leibnitz, Amrik Singh, Wang Gungwu & Anthony C. Yu - 1992 - Minerva 30 (2):206-241.
  40. Basic Properties and Sense Datum Attributes.Andr Gallois - 1979 - Personalist 60 (January):53-60.
     
    Export citation  
     
    Bookmark  
  41.  42
    Deflationary Self-Knowledge.Andr Gallois - 1994 - In M. Michael & John O'Leary-Hawthorne (eds.), Philosophy in Mind: The Place of Philosophy in the Study of Mind. Kluwer Academic Publishers. pp. 49--63.
    As a number of philosophers have observed, our knowledge of what is passing through our own minds appears to be quite different to our knowledge of other things. I do not, it seems, need to accumulate evidence in order to know what psychological states I am in. 1 Without relying on evidence I am able to effortlessly attribute to myself beliefs, desires, intentions, hopes, fears, and a host of other psychological states. The distinctive knowledge we have of our own psychological (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  42.  3
    Geschichte einer Trauer und eines neuen Pneumas : Gedanken Eines Psychoanalytikers über Drei Texte der Apostelgeschichte.Andrέ Godin - 1988 - Archive for the Psychology of Religion 18 (1):19-37.
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  43.  96
    Meaning Holism and Intentional Psychology.Andr Kukla - 1989 - Analysis 49 (October):173-175.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  44. "Інший" Як Центральна Проблема Етики Емануеля Левінаса.Andrіі Morozov - 2014 - Схід 2 (128):158-162.
    У статті досліджено погляди Е. Левінаса на проблему Іншого. Зазначається, що в центр етичних відносин філософ ставить Іншого, який виступає абсолютно трансцендентним ликом, не підвладним "насиллю теорії" і асиметричним по відношенню до дій Я. Шлях до відкриття безкінечності лику Іншого по той бік об'єктивації в пізнанні Е. Левінас убачає в застосуванні феноменологічної процедури "епохе".
     
    Export citation  
     
    Bookmark  
  45.  24
    A Cybernetic Observatory Based on Panoramic Vision.Andr Parente & Luiz Velho - 2008 - Technoetic Arts 6 (1):79-98.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  46. Plugging a Tooth Before Anaesthetising the Patient? The Influence of People's Beliefs on Reasoning About the Temporal Order of Actions.Vicky Dierckx & Andr - 2004 - Thinking and Reasoning 10 (4):371 – 404.
    According to the mental models theory, reasoning performance is primarily influenced by the number of models of a problem that can be constructed. This study investigates whether the content of the model may also influence performance. Linear reasoning problems were devised that either described a believable (script-consistent) or an unbelievable (script-inconsistent) order of actions. The results of two experiments showed that conclusions were inferred more slowly and less accurately on the basis of an unbelievable model than on a believable one. (...)
     
    Export citation  
     
    Bookmark   1 citation  
  47. On the Filter of Computably Enumerable Supersets of an R-Maximal Set.Steffen Lempp, André Nies & D. Reed Solomon - 2001 - Archive for Mathematical Logic 40 (6):415-423.
    We study the filter ℒ*(A) of computably enumerable supersets (modulo finite sets) of an r-maximal set A and show that, for some such set A, the property of being cofinite in ℒ*(A) is still Σ0 3-complete. This implies that for this A, there is no uniformly computably enumerable “tower” of sets exhausting exactly the coinfinite sets in ℒ*(A).
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  48.  17
    Representations for Small Relation Algebras.Hajnal Andr Eka & Roger D. Maddux - 1994 - Notre Dame Journal of Formal Logic 35 (4).
  49.  36
    Initial Segments of the Lattice of Π10 Classes.Douglas Cenzer & Andre Nies - 2001 - Journal of Symbolic Logic 66 (4):1749-1765.
    We show that in the lattice E Π of Π 0 1 classes there are initial segments [ $\emptyset$ , P] = L(P) which are not Boolean algebras, but which have a decidable theory. In fact, we will construct for any finite distributive lattice L which satisfies the dual of the usual reduction property a Π 0 1 class P such that L is isomorphic to the lattice L(P)*, which is L(P), modulo finite differences. For the 2-element lattice, we obtain (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  50.  12
    André Nies. Lowness Properties and Randomness. Advances in Mathematics, Vol. 197 , No. 1, Pp. 274–305. - Bjørn Kjos-Hanssen, André Nies, and Frank Stephan. Lowness for the Class of Schnorr Random Reals. SIAM Journal on Computing, Vol. 35 , No. 3, Pp. 647–657. - Noam Greenberg and Joseph S. Miller. Lowness for Kurtz Randomness. The Journal of Symbolic Logic, Vol. 74 , No. 2, Pp. 665–678. - Laurent Bienvenu and Joseph S. Miller. Randomness and Lowness Notions Via Open Covers. Annals of Pure and Applied Logic, Vol. 163 , No. 5, Pp. 506–518. - Johanna N. Y. Franklin, Frank Stephan, and Liang. Yu Relativizations of Randomness and Genericity Notions. The Bulletin of the London Mathematical Society, Vol. 43 , No. 4, Pp. 721–733. - George Barmpalias, Joseph S. Miller, and André Nies. Randomness Notions and Partial Relativization. Israel Journal of Mathematics, Vol. 191 , No. 2, Pp. 791–816. [REVIEW]Johanna N. Y. Franklin - 2013 - Bulletin of Symbolic Logic 19 (1):115-118.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 138