Results for 'Eduardo Shore'

1000+ found
Order:
  1. La prueba de McTaggart de la irrealidad del tiempo.Eduardo Shore - 2002 - Princípios 9 (11):27-61.
    McTaggart se apoya en el hecho de que no percibimos el tiempo en si mismo, un tiempo vacio de sucesos: lo que en verdad percibimos es el transcurrir de los acontecimientos, tanto de los extemos como los de nuestro propio estado intemo en la conciencia. Todo el desarrollo de McTaggart y tambien su originalidad, consiste en el desentraiiamiento del mecanismo por el cual aprehendemos el caracter temporal del acaecer, a traves del cual tenemos la ilusión de que percibimos el tiempo. (...)
    Translate
     
     
    Export citation  
     
    Bookmark  
  2. Confrontación del tomismo con el idealismo trascendental kantiano".Eduardo Shore - 1988 - Philosophia:129.
    No categories
    Translate
     
     
    Export citation  
     
    Bookmark  
  3.  47
    Culture in Mind: Cognition, Culture, and the Problem of Meaning.Bradd Shore - 1996 - Oup Usa.
    Culture in Mind is an ethnographic portrait of the human mind. Using case studies from both western and nonwestern societies. Shore argues that "cultural models" are necessary to the functioning of the human mind. Drawing on recent developments in cognitive science as well as anthropology, Culture in Mind explores the cognitive world of culture in the ongoing production of meaning in everyday thinking and feeling.
    Direct download  
     
    Export citation  
     
    Bookmark   77 citations  
  4.  18
    Countable Thin Π01 Classes.Douglas Cenzer, Rodney Downey, Carl Jockusch & Richard A. Shore - 1993 - Annals of Pure and Applied Logic 59 (2):79-139.
    Cenzer, D., R. Downey, C. Jockusch and R.A. Shore, Countable thin Π01 classes, Annals of Pure and Applied Logic 59 79–139. A Π01 class P {0, 1}ω is thin if every Π01 subclass of P is the intersection of P with some clopen set. Countable thin Π01 classes are constructed having arbitrary recursive Cantor- Bendixson rank. A thin Π01 class P is constructed with a unique nonisolated point A and furthermore A is of degree 0’. It is shown that (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  5. A Computably Categorical Structure Whose Expansion by a Constant has Infinite Computable Dimension.Denis R. Hirschfeldt, Bakhadyr Khoussainov & Richard A. Shore - 2003 - Journal of Symbolic Logic 68 (4):1199-1241.
    Cholak, Goncharov, Khoussainov, and Shore [1] showed that for each k > 0 there is a computably categorical structure whose expansion by a constant has computable dimension k. We show that the same is true with k replaced by ω. Our proof uses a version of Goncharov's method of left and right operations.
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  6.  17
    Undecidability and 1-Types in the Recursively Enumerable Degrees.Klaus Ambos-Spies & Richard A. Shore - 1993 - Annals of Pure and Applied Logic 63 (1):3-37.
    Ambos-Spies, K. and R.A. Shore, Undecidability and 1-types in the recursively enumerable degrees, Annals of Pure and Applied Logic 63 3–37. We show that the theory of the partial ordering of recursively enumerable Turing degrees is undecidable and has uncountably many 1-types. In contrast to the original proof of the former which used a very complicated O''' argument our proof proceeds by a much simpler infinite injury argument. Moreover, it combines with the permitting technique to get similar results for (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  7.  19
    The Theory of the Metarecursively Enumerable Degrees.Noam Greenberg, Richard A. Shore & Theodore A. Slaman - 2006 - Journal of Mathematical Logic 6 (1):49-68.
    Sacks [23] asks if the metarecursively enumerable degrees are elementarily equivalent to the r.e. degrees. In unpublished work, Slaman and Shore proved that they are not. This paper provides a simpler proof of that result and characterizes the degree of the theory as [Formula: see text] or, equivalently, that of the truth set of [Formula: see text].
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  8.  94
    Codes of Ethics as Signals for Ethical Behavior.Janet S. Adams, Armen Tashchian & Ted H. Shore - 2001 - Journal of Business Ethics 29 (3):199 - 211.
    This study investigated effects of codes of ethics on perceptions of ethical behavior. Respondents from companies with codes of ethics (n = 465) rated role set members (top management, supervisors, peers, subordinates, self) as more ethical and felt more encouraged and supported for ethical behavior than respondents from companies without codes (n = 301). Key aspects of the organizational climate, such as supportiveness for ethical behavior, freedom to act ethically, and satisfaction with the outcome of ethical problems were impacted by (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   118 citations  
  9.  55
    Social Costs of Environmental Justice Associated with the Practice of Green Marketing.Janet S. Adams, Armen Tashchian & Ted H. Shore - 2001 - Journal of Business Ethics 29 (3):199-211.
    This study investigated effects of codes of ethics on perceptions of ethical behavior. Respondents from companies with codes of ethics (n = 465) rated role set members (top management, supervisors, peers, subordinates, self) as more ethical and felt more encouraged and supported for ethical behavior than respondents from companies without codes (n = 301). Key aspects of the organizational climate, such as supportiveness for ethical behavior, freedom to act ethically, and satisfaction with the outcome of ethical problems were impacted by (...)
    Direct download  
     
    Export citation  
     
    Bookmark   89 citations  
  10.  31
    Combinatorial Principles Weaker Than Ramsey's Theorem for Pairs.Denis R. Hirschfeldt & Richard A. Shore - 2007 - Journal of Symbolic Logic 72 (1):171-206.
    We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus in particular on the principles ADS (Ascending or Descending Sequence), which states that every infinite linear order has either an infinite descending sequence or an infinite ascending sequence, and CAC (Chain-AntiChain), which states that every infinite partial order has either an infinite chain or an infinite antichain. It is well-known that Ramsey's Theorem for pairs (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  11.  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 (5 more)  
     
    Export citation  
     
    Bookmark   19 citations  
  12. Reverse Mathematics: The Playground of Logic.Richard A. Shore - 2010 - Bulletin of Symbolic Logic 16 (3):378-402.
    This paper is essentially the author's Gödel Lecture at the ASL Logic Colloquium '09 in Sofia extended and supplemented by material from some other papers. After a brief description of traditional reverse mathematics, a computational approach to is presented. There are then discussions of some interactions between reverse mathematics and the major branches of mathematical logic in terms of the techniques they supply as well as theorems for analysis. The emphasis here is on ones that lie outside the usual main (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  13. Axiomatic Derivation of the Principle of Maximum Entropy and the Principle of Minimum Cross-Entropy.J. E. Shore & R. W. Johnson - 1980 - IEEE Transactions on Information Theory:26-37.
  14.  19
    Direct and Local Definitions of the Turing Jump.Richard A. Shore - 2007 - Journal of Mathematical Logic 7 (2):229-262.
    We show that there are Π5 formulas in the language of the Turing degrees, [Formula: see text], with ≤, ∨ and ∧, that define the relations x″ ≤ y″, x″ = y″ and so {x ∈ L2 = x ≥ y|x″ = y″} in any jump ideal containing 0. There are also Σ6&Π6 and Π8 formulas that define the relations w = x″ and w = x', respectively, in any such ideal [Formula: see text]. In the language with just ≤ (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  15.  13
    Then-Rea Enumeration Degrees Are Dense.Alistair H. Lachlan & Richard A. Shore - 1992 - Archive for Mathematical Logic 31 (4):277-285.
  16.  38
    Computably Categorical Structures and Expansions by Constants.Peter Cholak, Sergey Goncharov, Bakhadyr Khoussainov & Richard A. Shore - 1999 - Journal of Symbolic Logic 64 (1):13-37.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  17.  37
    Pseudo-Jump Operators. II: Transfinite Iterations, Hierarchies and Minimal Covers.Carl G. Jockusch & Richard A. Shore - 1984 - Journal of Symbolic Logic 49 (4):1205 - 1236.
  18. A Computably Stable Structure with No Scott Family of Finitary Formulas.Peter Cholak, Richard A. Shore & Reed Solomon - 2006 - Archive for Mathematical Logic 45 (5):519-538.
  19.  72
    The Maximal Linear Extension Theorem in Second Order Arithmetic.Alberto Marcone & Richard A. Shore - 2011 - Archive for Mathematical Logic 50 (5-6):543-564.
    We show that the maximal linear extension theorem for well partial orders is equivalent over RCA 0 to ATR 0. Analogously, the maximal chain theorem for well partial orders is equivalent to ATR 0 over RCA 0.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  20.  26
    Working Below a Low2 Recursively Enumerably Degree.Richard A. Shore & Theodore A. Slaman - 1990 - Archive for Mathematical Logic 29 (3):201-211.
  21.  23
    Π 1 1 Relations and Paths Through.Sergey S. Goncharov, Valentina S. Harizanov, Julia F. Knight & Richard A. Shore - 2004 - Journal of Symbolic Logic 69 (2):585-611.
  22. Σn Sets Which Are Δn-Incomparable.Richard A. Shore - 1974 - Journal of Symbolic Logic 39 (2):295 - 304.
  23.  16
    Spiritual Work, Memory Work: Revival and Recollection at Salem Camp Meeting.Bradd Shore - 2008 - Ethos: Journal of the Society for Psychological Anthropology 36 (1):98-119.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  24.  14
    The Effects of Scene Inversion on Change Blindness.D. Shore & Raymond M. Klein - 2000 - Journal of General Psychology 127:27-43.
  25.  35
    Topological Aspects of the Medvedev Lattice.Andrew Em Lewis, Richard A. Shore & Andrea Sorbi - 2011 - Archive for Mathematical Logic 50 (3-4):319-340.
    We study the Medvedev degrees of mass problems with distinguished topological properties, such as denseness, closedness, or discreteness. We investigate the sublattices generated by these degrees; the prime ideal generated by the dense degrees and its complement, a prime filter; the filter generated by the nonzero closed degrees and the filter generated by the nonzero discrete degrees. We give a complete picture of the relationships of inclusion holding between these sublattices, these filters, and this ideal. We show that the sublattice (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  26.  61
    Degree Structures: Local and Global Investigations.Richard A. Shore - 2006 - Bulletin of Symbolic Logic 12 (3):369-389.
  27.  20
    Working Below a High Recursively Enumerable Degree.Richard A. Shore & Theodore A. Slaman - 1993 - Journal of Symbolic Logic 58 (3):824-859.
  28.  29
    Highness and Bounding Minimal Pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
  29. Definability in the Recursively Enumerable Degrees.André Nies, Richard A. Shore & Theodore A. Slaman - 1996 - Bulletin of Symbolic Logic 2 (4):392-404.
  30.  33
    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   8 citations  
  31. Decomposition and Infima in the Computably Enumerable Degrees.Rodney G. Downey, Geoffrey L. Laforte & Richard A. Shore - 2003 - Journal of Symbolic Logic 68 (2):551-579.
    Given two incomparable c.e. Turing degrees a and b, we show that there exists a c.e. degree c such that c = (a ⋃ c) ⋂ (b ⋃ c), a ⋃ c | b ⋃ c, and c < a ⋃ b.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  32.  87
    Nowhere Simple Sets and the Lattice of Recursively Enumerable Sets.Richard A. Shore - 1978 - Journal of Symbolic Logic 43 (2):322-330.
  33.  16
    Recursion Theory.Anil Nerode & Richard A. Shore (eds.) - 1985 - American Mathematical Society.
    iterations of REA operators, as well as extensions, generalizations and other applications are given in [6] while those for the ...
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  34.  38
    Ethical Issues and Concerns Associated with Mentoring Undergraduate Students.Dana D. Anderson & Wendelyn J. Shore - 2008 - Ethics and Behavior 18 (1):1 – 25.
    The importance of a healthy mentoring relationship, and how to go about achieving one, has been explored in several disciplines, including psychology. However, little of this work has focused specifically on unique ethical issues that may arise while mentoring undergraduate students. The authors provide a definition of mentoring in the context of undergraduate education that takes into account undergraduates' status as emerging adults. We delineate both similarities and differences between mentoring undergraduate students and graduate students. Ethical issues that may arise (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  35.  28
    On Homogeneity and Definability in the First-Order Theory of the Turing Degrees.Richard A. Shore - 1982 - Journal of Symbolic Logic 47 (1):8-16.
  36.  42
    Effectiveness of Research Guidelines in Prevention of Scientific Misconduct.Eleanor G. Shore - 1995 - Science and Engineering Ethics 1 (4):383-387.
    In response to a series of allegations of scientific misconduct in the 1980’s, a number of scientific societies, national agencies, and academic institutions, including Harvard Medical School, devised guidelines to increase awareness of optimal scientific practices and to attempt to prevent as many episodes of misconduct as possible. The chief argument for adopting guidelines is to promote good science. There is no evidence that well-crafted guidelines have had any detrimental effect on creativity since they focus on design of research studies, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  37.  44
    Degree Theoretic Definitions of the Low2 Recursively Enumerable Sets.Rod Downey & Richard A. Shore - 1995 - Journal of Symbolic Logic 60 (3):727 - 756.
  38.  46
    Keeping the Conversation Going: An Interview with Jerome Bruner.Bradd Shore - 1997 - Ethos: Journal of the Society for Psychological Anthropology 25 (1):7-62.
  39. The Reviews.Richard A. Shore - 2003 - Bulletin of Symbolic Logic 9 (1):1-2.
  40.  39
    The Prospects for Mathematical Logic in the Twenty-First Century.Samuel R. Buss, Alexander S. Kechris, Anand Pillay & Richard A. Shore - 2001 - Bulletin of Symbolic Logic 7 (2):169-196.
    The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.
    Direct download (12 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  41.  11
    Report of the AMA Council on Ethical and Judicial Affairs: Professionalism in the Use of Social Media.Rebecca Shore, Julia Halsey, Kavita Shah, Bette-Jane Crigger & Sharon P. Douglas - 2011 - Journal of Clinical Ethics 22 (2):165.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  42.  44
    Breaking the Rule of Discipline in Interdisciplinarity: Redefining Professors, Students, and Staff as Faculty.Alison Cook-Sather & Elliott Shore - 2007 - Journal of Research Practice 3 (2):Article M15.
    In this article we attempt to complicate traditional--and, we argue, limited and exclusionary--definitions of interdisciplinarity as the bringing into dialogue of established disciplines without questioning the parameters and practices of those disciplines. We propose that interdisciplinarity instead might mean teaching and learning among, between, and in the midst of those of innate or learned capacities--not only college faculty but also students and staff. To illustrate this more radical iteration of interdisciplinarity, we draw on a range of definitions of the key (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  43.  34
    Boolean Algebras, Tarski Invariants, and Index Sets.Barbara F. Csima, Antonio Montalbán & Richard A. Shore - 2006 - Notre Dame Journal of Formal Logic 47 (1):1-23.
    Tarski defined a way of assigning to each Boolean algebra, B, an invariant inv(B) ∈ In, where In is a set of triples from ℕ, such that two Boolean algebras have the same invariant if and only if they are elementarily equivalent. Moreover, given the invariant of a Boolean algebra, there is a computable procedure that decides its elementary theory. If we restrict our attention to dense Boolean algebras, these invariants determine the algebra up to isomorphism. In this paper we (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  44.  14
    Controlling the Dependence Degree of a Recursive Enumerable Vector Space.Richard A. Shore - 1978 - Journal of Symbolic Logic 43 (1):13-22.
  45. Self-Prescribed and Other Informal Care Provided by Physicians: Scope, Correlations and Implications.M. H. Gendel, E. Brooks, S. R. Early, D. C. Gundersen, S. L. Dubovsky, S. L. Dilts & J. H. Shore - 2012 - Journal of Medical Ethics 38 (5):294-298.
    Background While it is generally acknowledged that self-prescribing among physicians poses some risk, research finds such behaviour to be common and in certain cases accepted by the medical community. Largely absent from the literature is knowledge about other activities doctors perform for their own medical care or for the informal treatment of family and friends. This study examined the variety, frequency and association of behaviours doctors report providing informally. Informal care included prescriptions, as well as any other type of personal (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  46.  3
    Do Social Utility Judgments Influence Attentional Processing?Danielle M. Shore & Erin A. Heerey - 2013 - Cognition 129 (1):114-122.
  47.  64
    Metáforas polémicas: El Caso de la argumentación (Polemic Metaphors: The Case of Argumentation).De Bustos Eduardo - 1996 - Theoria 11 (1):21-40.
    (Spanish) La argumentación es un aspecto publico y comunicativo, quizás no el único, de los procesos cognitivos inferenciales en la especie humana. Aunque los propios procesos cognitivos inferenciales no son exclusivos de los seres humanos, su expresión a través de la comunicación lingüística, su utilización en los procesos sociales para la conformación y cambio de las creencias y la conducta es propiamente humana. Una explicación correcta del concepto de argumentación es por tanto importante para captar nuestro concepto de racionalidad, de (...)
    Direct download (4 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  48.  21
    Lattice Initial Segments of the Hyperdegrees.Richard A. Shore & Bjørn Kjos-Hanssen - 2010 - Journal of Symbolic Logic 75 (1):103-130.
    We affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, $\scr{D}_{h}$ . In fact, we prove that every sublattice of any hyperarithmetic lattice (and so, in particular, every countable, locally finite lattice) is isomorphic to an initial segment of $\scr{D}_{h}$ . Corollaries include the decidability of the two quantifier theory of $\scr{D}_{h}$ and the undecidability of its three quantifier theory. The key tool in the proof is a (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  49.  18
    Conjectures and Questions From Gerald Sacks's Degrees of Unsolvability.Richard A. Shore - 1997 - Archive for Mathematical Logic 36 (4-5):233-253.
    . We describe the important role that the conjectures and questions posed at the end of the two editions of Gerald Sacks's Degrees of Unsolvability have had in the development of recursion theory over the past thirty years.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  50.  83
    The N-R.E. Degrees: Undecidability and Σ1 Substructures.Mingzhong Cai, Richard A. Shore & Theodore A. Slaman - 2012 - Journal of Mathematical Logic 12 (1):1250005-.
    We study the global properties of [Formula: see text], the Turing degrees of the n-r.e. sets. In Theorem 1.5, we show that the first order of [Formula: see text] is not decidable. In Theorem 1.6, we show that for any two n and m with n < m, [Formula: see text] is not a Σ1-substructure of [Formula: see text].
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000