Results for 'Theodore A. Burczak'

1000+ found
Order:
  1.  61
    The Postmodern Moments of F. A. Hayek'S Economics.Theodore A. Burczak - 1994 - Economics and Philosophy 10 (1):31-58.
    Postmodernism is often characterized, among other things, as the belief in the unattainability of objective truth and as a rejection of teleological and reductionist, or essentialist, forms of thought. For instance, in his provocative book The Rhetoric of Economics, Donald McCloskey sketches the implications for economic methodology of Richard Rorty's rejection of the modernist quest for Truth, as represented by various rationalist and empiricist epistemologies. McCloskey describes modernist methodology as displaying a desire to predict and control, a search for objective–;which (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  2.  13
    Reply to Bruce Caldwell: Can Subjectivism Be Non-Hermeneutic?Theodore A. Burczak - 1994 - Economics and Philosophy 10 (2):315-317.
  3.  16
    Causal Powers.Theodore A. Young - 1976 - Philosophy and Phenomenological Research 37 (2):268-269.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   50 citations  
  4.  40
    Could robots become authentic companions in nursing care?Theodore A. Metzler, Lundy M. Lewis & Linda C. Pope - 2016 - Nursing Philosophy 17 (1):36-48.
    Creating android and humanoid robots to furnish companionship in the nursing care of older people continues to attract substantial development capital and research. Some people object, though, that machines of this kind furnish human–robot interaction characterized by inauthentic relationships. In particular, robotic and artificial intelligence (AI) technologies have been charged with substituting mindless mimicry of human behaviour for the real presence of conscious caring offered by human nurses. When thus viewed as deceptive, the robots also have prompted corresponding concerns regarding (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  5.  6
    Financing international institutions.Theodore A. Sumberg - 1946 - Social Research: An International Quarterly 13 (3):276-306.
  6.  5
    Toynbee and the decline of Western civilization.Theodore A. Sumberg - 1947 - Social Research: An International Quarterly 14 (3):267-284.
    Direct download  
     
    Export citation  
     
    Bookmark  
  7.  38
    Low upper bounds of ideals.Antonín Kučera & Theodore A. Slaman - 2009 - Journal of Symbolic Logic 74 (2):517-534.
    We show that there is a low T-upper bound for the class of K-trivial sets, namely those which are weak from the point of view of algorithmic randomness. This result is a special case of a more general characterization of ideals in $\Delta _2^0 $ T-degrees for which there is a low T-upper bound.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  8.  3
    Completing Berkeley's Project: Classical Vs.Theodore A. Young - 1985
  9.  23
    Three dialogues concerning robots in elder care.Theodore A. Metzler & Susan J. Barnes - 2014 - Nursing Philosophy 15 (1):4-13.
    The three dialogues in this contribution concern 21st century application of life‐like robots in the care of older adults. They depict conversations set in the near future, involving a philosopher (Dr Phonius) and a nurse (Dr Myloss) who manages care at a large facility for assisted living. In their first dialogue, the speakers discover that their quite different attitudes towards human‐robot interaction parallel fundamental differences separating their respective concepts of consciousness. The second dialogue similarly uncovers deeply contrasting notions of personhood (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  10.  4
    are Dense.Theodore A. Slaman - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 42--195.
    Direct download  
     
    Export citation  
     
    Bookmark  
  11.  32
    Mathematical definability.Theodore A. Slaman - 1998 - In H. G. Dales & Gianluigi Oliveri (eds.), Truth in Mathematics. Oxford University Press, Usa. pp. 233.
    Direct download  
     
    Export citation  
     
    Bookmark  
  12.  8
    The density of infima in the recursively enumerable degrees.Theodore A. Slaman - 1991 - Annals of Pure and Applied Logic 52 (1-2):155-179.
    We show that every nontrivial interval in the recursively enumerable degrees contains an incomparable pair which have an infimum in the recursively enumerable degrees.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  13.  37
    Definability in the enumeration degrees.Theodore A. Slaman & W. Hugh Woodin - 1997 - Archive for Mathematical Logic 36 (4-5):255-267.
    We prove that every countable relation on the enumeration degrees, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\frak E}$\end{document}, is uniformly definable from parameters in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\frak E}$\end{document}. Consequently, the first order theory of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\frak E}$\end{document} is recursively isomorphic to the second order theory of arithmetic. By an effective version of coding lemma, we show that the first order (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  14.  21
    Tools for a New Generation of Educational Software.Theodore A. Linden - 1994 - Inquiry: Critical Thinking Across the Disciplines 13 (1-2):32-38.
  15.  5
    The Traditional Crafts of Persia. Their Development, Technology, and Influence on Eastern and Western CivilizationsHans E. Wulff.Theodore A. Wertime - 1968 - Isis 59 (1):112-113.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16.  19
    Realism and Ultimate Explanation.Theodore A. Young - 1981 - Proceedings and Addresses of the American Philosophical Association 55:159.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  17.  35
    Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
    Posner [6] has shown, by a nonuniform proof, that every ▵ 0 2 degree has a complement below 0'. We show that a 1-generic complement for each ▵ 0 2 set of degree between 0 and 0' can be found uniformly. Moreover, the methods just as easily can be used to produce a complement whose jump has the degree of any real recursively enumerable in and above $\varnothing'$ . In the second half of the paper, we show that the complementation (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  18.  10
    A note on initial segments of the enumeration degrees.Theodore A. Slaman & Andrea Sorbi - 2014 - Journal of Symbolic Logic 79 (2):633-643.
  19.  2
    Causal Powers.Theodore A. Young - 1977 - Philosophy 52 (199):113-115.
  20.  31
    Privacy, Freedom, and Obscenity.Theodore A. Sumberg - 1971 - Journal of Critical Analysis 3 (2):84-96.
  21.  4
    Privacy, Freedom, and Obscenity.Theodore A. Sumberg - 1971 - Journal of Critical Analysis 3 (2):84-96.
  22. Sublimity, ugliness, and formlessness in Kant's aesthetic theory.Theodore A. Gracyk - 1986 - Journal of Aesthetics and Art Criticism 45 (1):49-56.
  23.  7
    The strength of ramsey’s theorem for pairs and arbitrarily many colors.Theodore A. Slaman & Keita Yokoyama - 2018 - Journal of Symbolic Logic 83 (4):1610-1617.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  24.  10
    Monkeys exhibit prospective memory in a computerized task.Theodore A. Evans & Michael J. Beran - 2012 - Cognition 125 (2):131-140.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  25.  16
    Differences between Resource Bounded Degree Structures.Theodore A. Slaman & Michael~E. Mytilinaios - 2003 - Notre Dame Journal of Formal Logic 44 (1):1-12.
    We exhibit a structural difference between the truth-table degrees of the sets which are truth-table above 0′ and the PTIME-Turing degrees of all sets. Though the structures do not have the same isomorphism type, demonstrating this fact relies on developing their common theory.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  26. Having bad taste.Theodore A. Gracyk - 1990 - British Journal of Aesthetics 30 (2):117-131.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  27.  49
    On the Kleene degrees of Π 1 1 sets.Theodore A. Slaman - 1986 - Journal of Symbolic Logic 51 (2):352-359.
    Let A and B be subsets of the reals. Say that A κ ≥ B, if there is a real a such that the relation "x ∈ B" is uniformly Δ 1 (a, A) in L[ ω x,a,A 1 , x,a,A]. This reducibility induces an equivalence relation $\equiv_\kappa$ on the sets of reals; the $\equiv_\kappa$ -equivalence class of a set is called its Kleene degree. Let K be the structure that consists of the Kleene degrees and the induced partial order (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  28.  91
    Extending partial orders to dense linear orders.Theodore A. Slaman & W. Hugh Woodin - 1998 - Annals of Pure and Applied Logic 94 (1-3):253-261.
    J. Łoś raised the following question: Under what conditions can a countable partially ordered set be extended to a dense linear order merely by adding instances of comparability ? We show that having such an extension is a Σ 1 l -complete property and so there is no Borel answer to Łoś's question. Additionally, we show that there is a natural Π 1 l -norm on the partial orders which cannot be so extended and calculate some natural ranks in that (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  29.  8
    The Failure of Thomas Reid’s Aesthetics.Theodore A. Gracyk - 1987 - The Monist 70 (4):465-482.
    A spate of recent articles on Thomas Reid’s aesthetic theory constitutes a valuable commentary on both Reid’s own theory and on eighteenth-century aesthetics. However, while these articles provide a generally sympatheic introduction to Reid’s position, they are primarily expository in nature and uncritical in tone. I shall therefore address the plausibility of both Reid’s general aesthetic theory and the arguments advanced for the theory. I contend that his theory, however much an improvement over those offered by his contemporaries, is fatally (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  30.  8
    Rock: The Primary Text.Theodore A. Gracyk & Allan F. Moore - 1994 - Journal of Aesthetic Education 28 (4):105.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  31. Rethinking Hume's standard of taste.Theodore A. Gracyk - 1994 - Journal of Aesthetics and Art Criticism 52 (2):169-182.
  32.  49
    The Failure of Thomas Reid’s Aesthetics.Theodore A. Gracyk - 1987 - The Monist 70 (4):465-482.
    A spate of recent articles on Thomas Reid’s aesthetic theory constitutes a valuable commentary on both Reid’s own theory and on eighteenth-century aesthetics. However, while these articles provide a generally sympatheic introduction to Reid’s position, they are primarily expository in nature and uncritical in tone. I shall therefore address the plausibility of both Reid’s general aesthetic theory and the arguments advanced for the theory. I contend that his theory, however much an improvement over those offered by his contemporaries, is fatally (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  33.  27
    Pornography as Representation: Aesthetic Considerations.Theodore A. Gracyk - 1987 - The Journal of Aesthetic Education 21 (4):103.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  34.  46
    Siegel on Competency Testing and Critical Thinking.Theodore A. Gracyk - 1992 - Informal Logic 14 (2).
    Harvey Siegel argues that minimum competency testing (MCT) is incompatible with strong sense critical thinking. His arguments are reviewed and contrasted with positions held by John E. McPeck and Michael Scriven. Siegel's arguments seem directed against the prevailing form of MCT. However, alternative formats which allow for the aggregate and context-sensitive nature of critical thinking are not doomed to the arbitrariness Siegel finds. MCT may be a legitimate and useful means for furthering critical thinking as one of our educational ideals.
    Direct download (13 more)  
     
    Export citation  
     
    Bookmark  
  35.  4
    Art, Beauty, and Pornography.Theodore A. Gracyk & Jon Huer - 1988 - Journal of Aesthetic Education 22 (2):121.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  36.  26
    Are Kant’s “Aesthetic Judgment” and “Judgment of Taste” Synonymous?Theodore A. Gracyk - 1990 - International Philosophical Quarterly 30 (2):159-172.
  37.  19
    Kant's Doctrine of Heuristics.Theodore A. Gracyk - 1991 - Modern Schoolman 68 (3):191-210.
  38.  72
    Kant's shifting debt to british aesthetics.Theodore A. Gracyk - 1986 - British Journal of Aesthetics 26 (3):204-217.
  39.  27
    Romanticizing Rock Music.Theodore A. Gracyk - 1993 - The Journal of Aesthetic Education 27 (2):43.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  40.  11
    The Metaphysics of Transcendental Subjectivity.Theodore A. Gracyk - 1986 - Philosophical Books 27 (2):82-84.
  41.  28
    Working below a low2 recursively enumerably degree.Richard A. Shore & Theodore A. Slaman - 1990 - Archive for Mathematical Logic 29 (3):201-211.
  42.  60
    On the Strength of Ramsey's Theorem.David Seetapun & Theodore A. Slaman - 1995 - Notre Dame Journal of Formal Logic 36 (4):570-582.
    We show that, for every partition F of the pairs of natural numbers and for every set C, if C is not recursive in F then there is an infinite set H, such that H is homogeneous for F and C is not recursive in H. We conclude that the formal statement of Ramsey's Theorem for Pairs is not strong enough to prove , the comprehension scheme for arithmetical formulas, within the base theory , the comprehension scheme for recursive formulas. (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   48 citations  
  43.  22
    Working below a high recursively enumerable degree.Richard A. Shore & Theodore A. Slaman - 1993 - Journal of Symbolic Logic 58 (3):824-859.
  44.  24
    Σ2 -collection and the infinite injury priority method.Michael E. Mytilinaios & Theodore A. Slaman - 1988 - Journal of Symbolic Logic 53 (1):212-221.
    We show that the existence of a recursively enumerable set whose Turing degree is neither low nor complete cannot be proven from the basic axioms of first order arithmetic (P -) together with Σ 2 -collection (BΣ 2 ). In contrast, a high (hence, not low) incomplete recursively enumerable set can be assembled by a standard application of the infinite injury priority method. Similarly, for each n, the existence of an incomplete recursively enumerable set that is neither low n nor (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  45.  47
    A limit on relative genericity in the recursively enumerable sets.Steffen Lempp & Theodore A. Slaman - 1989 - Journal of Symbolic Logic 54 (2):376-395.
    Work in the setting of the recursively enumerable sets and their Turing degrees. A set X is low if X', its Turning jump, is recursive in $\varnothing'$ and high if X' computes $\varnothing''$ . Attempting to find a property between being low and being recursive, Bickford and Mills produced the following definition. W is deep, if for each recursively enumerable set A, the jump of $A \bigoplus W$ is recursive in the jump of A. We prove that there are no (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  46.  43
    Reflection and forcing in E-recursion theory.Theodore A. Slaman - 1985 - Annals of Pure and Applied Logic 29 (1):79-106.
    E -recursive enumerability is compared via forcing to Σ 1 definability. It is shown that for every countable E -closed ordinal κ there is a set of reals, X, so that L κ [ X ] is the least E -closed structure over X.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  47.  7
    R. Harré and E. H. Madden's "Causal Powers". [REVIEW]Theodore A. Young - 1976 - Philosophy and Phenomenological Research 37 (2):268.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  48. On extensions of embeddings into the enumeration degrees of the -sets.Steffen Lempp, Theodore A. Slaman & Andrea Sorbi - 2005 - Journal of Mathematical Logic 5 (02):247-298.
    We give an algorithm for deciding whether an embedding of a finite partial order [Formula: see text] into the enumeration degrees of the [Formula: see text]-sets can always be extended to an embedding of a finite partial order [Formula: see text].
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  49.  40
    A basis theorem for perfect sets.Marcia J. Groszek & Theodore A. Slaman - 1998 - Bulletin of Symbolic Logic 4 (2):204-209.
    We show that if there is a nonconstructible real, then every perfect set has a nonconstructible element, answering a question of K. Prikry. This is a specific instance of a more general theorem giving a sufficient condition on a pair $M\subset N$ of models of set theory implying that every perfect set in N has an element in N which is not in M.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  50.  25
    Entrepreneurship Amid Concurrent Institutional Constraints in Less Developed Countries.Ajnesh Prasad & Theodore A. Khoury - 2016 - Business and Society 55 (7):934-969.
    To encourage new research on the role of institutions in the entrepreneurial process in less developed countries, the authors propose a conceptual framework to investigate concurrent institutional constraints. The authors define these constraints as geopolitical contexts that encounter simultaneous challenges to well functioning formal and informal institutions. Systems of stronger institutions compensating for weaker institutions are hampered in these settings and such systems weigh heavier on local entrepreneurs and further challenge their ability to mobilize resources and access market opportunities. By (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
1 — 50 / 1000