Search results for 'R. E. Tully' (try it on Scholar)

998 found
Order:
  1.  8
    R. E. Tully (1976). Moore's Defence of Common Sense: A Reappraisal After Fifty Years: R. E. Tully. Philosophy 51 (197):289-306.
    G. E. Moore's ‘A Defence of Common Sense’ has generated the kind of interest and contrariety which often accompany what is new, provocative, and even important in philosophy. Moore himself reportedly agreed with Wittgenstein's estimate that this was his best article, while C. D. Broad has lamented its very great but largely unfortunate influence. Although the essay inspired Wittgenstein to explore the basis of Moore's claim to know many propositions of common sense to be true, A. J. Ayer judges its (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  2.  14
    G. H. E. (1888). Selected Letters of Pliny, with Notes for the Use of Schools by the Late C. E. Prichard, M.A. And E. R. Bernard, M.A. New Edition. 1887. Clarendon Press. 3s. [REVIEW] The Classical Review 2 (07):214-.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  3.  5
    Heinrich Rolletschek (1995). Some New Lattice Constructions in High R. E. Degrees. Mathematical Logic Quarterly 41 (3):395-430.
    A well-known theorem by Martin asserts that the degrees of maximal sets are precisely the high recursively enumerable degrees, and the same is true with ‘maximal’ replaced by ‘dense simple’, ‘r-maximal’, ‘strongly hypersimple’ or ‘finitely strongly hypersimple’. Many other constructions can also be carried out in any given high r. e. degree, for instance r-maximal or hyperhypersimple sets without maximal supersets . In this paper questions of this type are considered systematically. Ultimately it is shown that every conjunction of simplicity- (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  4.  2
    R. G. Downey & J. B. Remmel (1989). Classifications of Degree Classes Associated with R.E. Subspaces. Annals of Pure and Applied Logic 42 (2):105-124.
    In this article we show that it is possible to completely classify the degrees of r.e. bases of r.e. vector spaces in terms of weak truth table degrees. The ideas extend to classify the degrees of complements and splittings. Several ramifications of the classification are discussed, together with an analysis of the structure of the degrees of pairs of r.e. summands of r.e. spaces.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  5.  2
    Y. Yang & R. A. Shore (2002). A Nonlow~2 R.E. Degree with the Extension of Embeddings Properties of a Low~2 Degree. Mathematical Logic Quarterly 48 (1):131-146.
    We construct a nonlow2 r.e. degree d such that every positive extension of embeddings property that holds below every low2 degree holds below d. Indeed, we can also guarantee the converse so that there is a low r.e. degree c such that that the extension of embeddings properties true below c are exactly the ones true belowd.Moreover, we can also guarantee that no b ≤ d is the base of a nonsplitting pair.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  6. Jeffrey S. Carroll (1990). Maximal R.E. Equivalence Relations. Journal of Symbolic Logic 55 (3):1048-1058.
    The lattice of r.e. equivalence relations has not been carefully examined even though r.e. equivalence relations have proved useful in logic. A maximal r.e. equivalence relation has the expected lattice theoretic definition. It is proved that, in every pair of r.e. nonrecursive Turing degrees, there exist maximal r.e. equivalence relations which intersect trivially. This is, so far, unique among r.e. submodel lattices.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  7.  3
    Alexander Gavruskin, Sanjay Jain, Bakhadyr Khoussainov & Frank Stephan (2014). Graphs Realised by R.E. Equivalence Relations. Annals of Pure and Applied Logic 165 (7-8):1263-1290.
    We investigate dependence of recursively enumerable graphs on the equality relation given by a specific r.e. equivalence relation on ω. In particular we compare r.e. equivalence relations in terms of graphs they permit to represent. This defines partially ordered sets that depend on classes of graphs under consideration. We investigate some algebraic properties of these partially ordered sets. For instance, we show that some of these partial ordered sets possess atoms, minimal and maximal elements. We also fully describe the isomorphism (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  8. S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp & Robert I. Soare (1991). The D.R.E. Degrees Are Not Dense. Annals of Pure and Applied Logic 55 (2):125-151.
    By constructing a maximal incomplete d.r.e. degree, the nondensity of the partial order of the d.r.e. degrees is established. An easy modification yields the nondensity of the n-r.e. degrees and of the ω-r.e. degrees.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   10 citations  
  9.  1
    Geoffrey Laforte (1996). The Isolated D. R. E. Degrees Are Dense in the R. E. Degrees. 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 (4 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  10.  13
    Michael Stob (1983). Wtt-Degrees and T-Degrees of R.E. Sets. Journal of Symbolic Logic 48 (4):921-930.
    We use some simple facts about the wtt-degrees of r.e. sets together with a construction to answer some questions concerning the join and meet operators in the r.e. degrees. The construction is that of an r.e. Turing degree a with just one wtt-degree in a such that a is the join of a minimal pair of r.e. degrees. We hope to illustrate the usefulness of studying the stronger reducibility orderings of r.e. sets for providing information about Turing reducibility.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  11.  6
    Douglas Cenzer & Peter G. Hinman (2008). Degrees of Difficulty of Generalized R.E. Separating Classes. Archive for Mathematical Logic 46 (7-8):629-647.
    Important examples of $\Pi^0_1$ classes of functions $f \in {}^\omega\omega$ are the classes of sets (elements of ω 2) which separate a given pair of disjoint r.e. sets: ${\mathsf S}_2(A_0, A_1) := \{f \in{}^\omega2 : (\forall i < 2)(\forall x \in A_i)f(x) \neq i\}$ . A wider class consists of the classes of functions f ∈ ω k which in a generalized sense separate a k-tuple of r.e. sets (not necessarily pairwise disjoint) for each k ∈ ω: ${\mathsf S}_k(A_0,\ldots,A_k-1) := (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  12.  4
    John Love (1993). Stability Among R.E. Quotient Algebras. Annals of Pure and Applied Logic 59 (1):55-63.
    A recursive algebra is a structure for which A is a recursive set of numbers and the Fi are uniformly recursive operations. We define an r.e. quotient algebra to be the quotient by an r.e. congruence .We say that is recursively stable among r.e. quotient algebras if, for each r.e. quotient algebra and each isomorphism from onto ′, the set {a,baA,bB and =[b]′} is r.e.We shall consider examples of recursive stability. Then, assuming that has a recursive existential diagram, we show (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  13.  3
    D. Kaddah (1993). Infima in the D.R.E. Degrees. Annals of Pure and Applied Logic 62 (3):207-263.
    This paper analyzes several properties of infima in Dn, the n-r.e. degrees. We first show that, for every n> 1, there are n-r.e. degrees a, b, and c, and an -r.e. degree x such that a < x < b, c and, in Dn, b c = a. We also prove a related result, namely that there are two d.r.e. degrees that form a minimal pair in Dn, for each n < ω, but that do not form a minimal pair (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  14.  5
    John J. Thurber (1994). Recursive and R.E. Quotient Boolean Algebras. Archive for Mathematical Logic 33 (2):121-129.
    We prove a converse to one of the theorems from [F], giving a description in terms of Turing complexity of sets which can be coded into recursive and r.e. quotient Boolean algebras.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  15.  8
    Simon Thompson (1985). Priority Arguments in the Continuous R. E. Degrees. Journal of Symbolic Logic 50 (3):661-667.
    We show that at each type k ≥ 2, there exist c-irreducible functionals of c-r.e. degree, as defined in [Nor 1]. Our proofs are based on arguments due to Hinman, [Hin 1], and Dvornikov, [Dvo 1].
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  16.  4
    Steffen Lempp & André Nies (1995). The Undecidability of the II4 Theory for the R. E. Wtt and Turing Degrees. 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  
     
    My bibliography   1 citation  
  17.  1
    Xiaoding Yi (1996). A Non-Splitting Theorem for D.R.E. Sets. Annals of Pure and Applied Logic 82 (1):17-96.
    A set of natural numbers is called d.r.e. if it may be obtained from some recursively enumerable set by deleting the numbers belonging to another recursively enumerable set. Sacks showed that for each non-recursive recursively enumerable set A there are disjoint recursively enumerable sets B, C which cover A such that A is recursive in neither A ∩ B nor A ∩ C. In this paper, we construct a counterexample which shows that Sacks's theorem is not in general true when (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  18.  5
    Arnold Beckmann (2002). A Non-Well-Founded Primitive Recursive Tree Provably Well-Founded for Co-R.E. Sets. Archive for Mathematical Logic 41 (3):251-257.
    We construct by diagonalization a non-well-founded primitive recursive tree, which is well-founded for co-r.e. sets, provable in Σ1 0. It follows that the supremum of order-types of primitive recursive well-orderings, whose well-foundedness on co-r.e. sets is provable in Σ1 0, equals the limit of all recursive ordinals ω1 ck . RID=""ID="" Mathematics Subject Classification (2000): 03B30, 03F15 RID=""ID="" Supported by the Deutschen Akademie der Naturforscher Leopoldina grant #BMBF-LPD 9801-7 with funds from the Bundesministerium für Bildung, Wissenschaft, Forschung und Technologie. RID=""ID="" (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  19.  4
    Jiang Liu, Shenling Wang & Guohua Wu (2010). Infima of D.R.E. Degrees. Archive for Mathematical Logic 49 (1):35-49.
    Lachlan observed that the infimum of two r.e. degrees considered in the r.e. degrees coincides with the one considered in the ${\Delta_2^0}$ degrees. It is not true anymore for the d.r.e. degrees. Kaddah proved in (Ann Pure Appl Log 62(3):207–263, 1993) that there are d.r.e. degrees a, b, c and a 3-r.e. degree x such that a is the infimum of b, c in the d.r.e. degrees, but not in the 3-r.e. degrees, as a < x < b, c. In (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  20.  6
    Shamil Ishmukhametov (1999). On the R.E. Predecessors of D.R.E. Degrees. Archive for Mathematical Logic 38 (6):373-386.
    Let d be a Turing degree containing differences of recursively enumerable sets (d.r.e.sets) and R[d] be the class of less than d r.e. degrees in whichd is relatively enumerable (r.e.). A.H.Lachlan proved that for any non-recursive d.r.e. d R[d] is not empty. We show that the r.e. degree defined by Lachlan for a d.r.e.set $D\in$ d is just the minimum degree in which D is r.e. Then we study for a given d.r.e. degree d class R[d] and show that there (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  21.  12
    P. Eddy Wilson (1994). Corporations, Minors, and Other Innocents — a Reply to R. E. Ewin. Journal of Business Ethics 13 (10):761 - 774.
    R. E. Ewin has argued that corporations are moral persons, but Ewin describes them as being unable to think or to act in virtuous and vicious ways. Ewin thinks that their impoverished emotional life would not allow them to act in these ways. In this brief essay I want to challenge the idea that corporations cannot act virtuously. I begin by examining deficiencies in Ewin''s notion of corporate personhood. I argue that he effectively reduces corporations to the status of incompetent (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  22.  5
    Martin Kummer & Frank Stephan (1993). Weakly Semirecursive Sets and R.E. Orderings. Annals of Pure and Applied Logic 60 (2):133-150.
    Weakly semirecursive sets have been introduced by Jockusch and Owings . In the present paper their investigation is pushed forward by utilizing r.e. partial orderings, which turn out to be instrumental for the study of degrees of subclasses of weakly semirecursive sets.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  23.  5
    Steffen Lempp & Andre Nies (1995). The Undecidability of the II$^_4$ Theory for the R. E. Wtt and Turing Degrees. 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 (5 more)  
     
    Export citation  
     
    My bibliography  
  24.  4
    Marat Arslanov, Steffen Lempp & Richard A. Shore (1996). Interpolating D-R.E. And REA Degrees Between R.E. Degrees. Annals of Pure and Applied Logic 78 (1-3):29-56.
    We provide three new results about interpolating 2-r.e. or 2-REA degrees between given r.e. degrees: Proposition 1.13. If c h are r.e. , c is low and h is high, then there is an a h which is REA in c but not r.e. Theorem 2.1. For all high r.e. degrees h g there is a properly d-r.e. degree a such that h a g and a is r.e. in h . Theorem 3.1. There is an incomplete nonrecursive r.e. A (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  25.  3
    Theodora-Eliza Vacarescu (2010). Mihaela Miroiu & Mircea Miclea, R'Estul şi Vestul/ The R'E(a)st and the West. Journal for the Study of Religions and Ideologies 5 (14):159-160.
    Mihaela Miroiu & Mircea Miclea, R'Estul şi Vestul (The R'E(a)st and the West) Polirom Publishing House, Iaşi, 2005, 367 pages.
    Translate
      Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  26.  6
    Klaus Ambos-Spies, Decheng Ding, Wei Wang & Liang Yu (2009). Bounding Non- GL ₂ and R.E.A. Journal of Symbolic Logic 74 (3):989-1000.
    We prove that every Turing degree a bounding some non-GL₂ degree is recursively enumerable in and above (r.e.a.) some 1-generic degree.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  27.  3
    Klaus Sutner (1990). The Ordertype of Β-R.E. Sets. Journal of Symbolic Logic 55 (2):573-576.
    Let β be an arbitrary limit ordinal. A β-r.e. set is l-finite iff all its β-r.e. subsets are β-recursive. The l-finite sets correspond to the ideal of finite sets in the lattice of r.e. sets. We give a characterization of l-finite sets in terms of their ordertype: a β-r.e. set is l-finite iff it has ordertype less than β * , the Σ 1 projectum of β.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  28.  3
    Mark R. Tonelli (2009). A Late and Shifting Foundation: A Commentary on Djulbegovic, B., Guyatt, G. H. & Ashcroft, R. E. (2009) Cancer Control, 16, 158–168. [REVIEW] Journal of Evaluation in Clinical Practice 15 (6):907-909.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   10 citations  
  29.  10
    Marek Tokarz (1979). The Existence of Matrices Strongly Adequate for E, R and Their Fragments. Studia Logica 38 (1):75 - 85.
    A logic is a pair (P,Q) where P is a set of formulas of a fixed propositional language and Q is a set of rules. A formula is deducible from X in the logic (P, Q) if it is deducible from XP via Q. A matrix is strongly adequate to (P, Q) if for any , X, is deducible from X iff for every valuation in , is designated whenever all the formulas in X are. It is proved in the (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  30.  16
    R. E. Witt (1972). Marcello Massenzio: Cultura e crisi permanente: la 'xenia' dionisiaca. (Quaderni di S.M.S.R.) Pp. 113. Rome: Edizioni dell' Ateneo, 1970. Paper, L. 1,800. [REVIEW] The Classical Review 22 (02):287-288.
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  31.  8
    R. G. Downey & T. A. Slaman (1989). Completely Mitotic R.E. Degrees. Annals of Pure and Applied Logic 41 (2):119-152.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  32.  2
    R. G. Downey & L. V. Welch (1986). Splitting Properties of R. E. Sets and Degrees. Journal of Symbolic Logic 51 (1):88-109.
  33.  6
    R. G. Downey (1986). Undecidability of L and Other Lattices of R.E. Substructures. Annals of Pure and Applied Logic 32 (1):17-26.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  34.  7
    R. G. Downey (1989). Intervals and Sublattices of the R.E. Weak Truth Table Degrees, Part I: Density. Annals of Pure and Applied Logic 41 (1):1-26.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  35.  44
    B. R. Rees (1960). A. H. R. E. Paap: Nomina Sacra in the Greek Papyri of the First Five Centuries A.D.: The Sources and Some Deductions. (Papyrologica Lugduno Batava, Vol. Viii.) Pp. 127. Leiden: Brill, 1959. Paper, Fl. 40. [REVIEW] The Classical Review 10 (03):259-260.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  36.  11
    R. G. Downey (1989). Intervals and Sublattices of the R.E. Weak Truth Table Degrees, Part II: Nonbounding. Annals of Pure and Applied Logic 44 (3):153-172.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  37.  15
    R. M. Ogilvie (1977). Roman Religion R. E. A. Palmer: Roman Religion and Roman Empire: Five Essays. Pp. Xii + 291. Philadelphia: University of Pennsylvania Press, 1974. Cloth, $25. [REVIEW] The Classical Review 27 (01):47-48.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  38.  11
    Zhang Qinglong (1992). The Density of the Meet-Inaccessible R.E. Degrees. Journal of Symbolic Logic 57 (2):585-596.
    In this paper it is shown that the meet-inaccessible degrees are dense in R. The construction uses an 0''-priority argument. As a consequence, the meet-inaccessible degrees and the meet-accessible degrees give a partition of R into two sets, either of which is a nontrivial dense subset of R and generates R - {0} under joins (thus an automorphism base of R).
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  39.  24
    E. D. Phillips (1973). R. E. Siegel: Galen on Sense Perception. Pp. Xi+207. Basel: S. Karger, 1970. Cloth, 64 Sw.Fr. The Classical Review 23 (01):90-91.
  40.  15
    F. R. D. Goodyear (1964). R. E. H. Westendorp Boerma: P. Vergili Maronis libellus qui inscribitur Catalepton conspectu librorum et commentationum, notis criticis, commentario exegetico instructus. Pars altera. Pp. viii + 120. Assen, Netherlands: Van Gorcum, 1963. Cloth. [REVIEW] The Classical Review 14 (02):219-220.
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  41.  14
    A. R. Burn (1990). R. E. Bell: Place-Names in Classical Mythology: Greece. Pp. Xiii + 350. Santa Barbara, Cal. And Oxford: ABC-Clio, 1989. £34.75. [REVIEW] The Classical Review 40 (02):529-530.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  42.  12
    E. G. Turner (1973). The Papyri of Xenophon A. H. R. E. Paap: The Xenophon Papyri. (Papyrologica Lugduno-Batava Xviii.) Pp. Viii+92. Leiden: Brill, 1970. Paper, Fl. 42. [REVIEW] The Classical Review 23 (02):144-145.
  43.  1
    Robert E. Byerly (1983). Definability of R. E. Sets in a Class of Recursion Theoretic Structures. Journal of Symbolic Logic 48 (3):662-669.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  44. E. J. Aiton (1975). Leibniz and Dynamics. The Texts of 1692Pierre Costabel R. E. W. Maddison. Isis 66 (1):129-130.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  45. David J. Furley & Reginald E. Allen (1970). Studies in Presocratic Philosophy Edited by David J. Furley and R.E. Allen. --. Routledge and K. Paul.
     
    Export citation  
     
    My bibliography  
  46. James R. Geiser (1975). Yessenin-Volpin A. S.. The Ultra-Intuitionistic Criticism and the Antitraditional Program for Foundations of Mathematics. Intuitionism and Proof Theory, Proceedings of the Summer Conference at Buffalo N.Y. 1968, Edited by Kino A., Myhill J., and Vesley R. E., Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Company, Amsterdam and London 1970, Pp. 3–45. [REVIEW] Journal of Symbolic Logic 40 (1):95-97.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  47. A. R. Hall (1972). BUTTS, R. E. And DAVIS, J. W. : "The Methodological Heritage of Newton". [REVIEW] British Journal for the Philosophy of Science 23:80.
     
    Export citation  
     
    My bibliography  
  48. T. J. R. Harris (1989). Recipes for the Molecular Biologist. Current Protocols in Molecular Biology. Edited by F. M. Ausubel, R. Brent, R. E. Kingston, D. D. Moore, J. F. Seidman, J. A. Smith and K. Struhl John Wiley and Sons. Inc., N.Y. Pp. 650. $180.00 for Core Volume; $300 for the Core Book + Supplements. [REVIEW] Bioessays 10 (4):132-132.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  49. R. Norman (1977). SARTORIUS, R. E. "Individual Conduct and Social Norms". [REVIEW] Mind 86:632.
    No categories
     
    Export citation  
     
    My bibliography  
  50. R. Robinson (1972). ALLEN, R. E. - "Plato's 'Euthyphro' and the Earlier Theory of Forms". [REVIEW] Mind 81:631.
     
    Export citation  
     
    My bibliography  
1 — 50 / 998