Results for 'Julia F. Göhner'

1000+ found
Order:
See also
Julia Göhner
University of Münster
  1.  28
    Moral Judgment Reloaded: A Moral Dilemma Validation Study.Julia F. Christensen, Albert Flexas, Margareta Calabrese, Nadine K. Gut & Antoni Gomila - 2014 - Frontiers in Psychology 5.
  2.  9
    Publishing Open, Reproducible Research With Undergraduates.Julia F. Strand & Violet A. Brown - 2019 - Frontiers in Psychology 10.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  12
    The Influence of Math Anxiety on Symbolic and Non-Symbolic Magnitude Processing.Julia F. Dietrich, Stefan Huber, Korbinian Moeller & Elise Klein - 2015 - Frontiers in Psychology 6.
  4.  24
    Degrees Coded in Jumps of Orderings.Julia F. Knight - 1986 - Journal of Symbolic Logic 51 (4):1034-1042.
  5. Computable Boolean Algebras.Julia F. Knight & Michael Stob - 2000 - Journal of Symbolic Logic 65 (4):1605-1623.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  6.  9
    A Decision Made Well.Julia F. Taylor & Mary Faith Marshall - 2018 - American Journal of Bioethics 18 (3):18-19.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7. A Complete L Ω1ω-Sentence Characterizing ℵ1.Julia F. Knight - 1977 - Journal of Symbolic Logic 42 (1):59-62.
  8.  16
    Scott Sentences for Certain Groups.Julia F. Knight & Vikram Saraph - 2018 - Archive for Mathematical Logic 57 (3-4):453-472.
    We give Scott sentences for certain computable groups, and we use index set calculations as a way of checking that our Scott sentences are as simple as possible. We consider finitely generated groups and torsion-free abelian groups of finite rank. For both kinds of groups, the computable ones all have computable \ Scott sentences. Sometimes we can do better. In fact, the computable finitely generated groups that we have studied all have Scott sentences that are “computable d-\” sentence and a (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  9. Hanf Numbers for Omitting Types Over Particular Theories.Julia F. Knight - 1976 - Journal of Symbolic Logic 41 (3):583-588.
  10.  8
    Turing Computable Embeddings.F. Knight Julia, Miller Sara & M. Vanden Boom - 2007 - Journal of Symbolic Logic 72 (3):901-918.
    In [3], two different effective versions of Borel embedding are defined. The first, called computable embedding, is based on uniform enumeration reducibility, while the second, called Turing computable embedding, is based on uniform Turing reducibility. While [3] focused mainly on computable embeddings, the present paper considers Turing computable embeddings. Although the two notions are not equivalent, we can show that they behave alike on the mathematically interesting classes chosen for investigation in [3]. We give a “Pull-back Theorem”, saying that if (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  11. Nonarithmetical ℵ0-Categorical Theories with Recursive Models.Julia F. Knight - 1994 - Journal of Symbolic Logic 59 (1):106 - 112.
  12.  66
    Classification From a Computable Viewpoint.Wesley Calvert & Julia F. Knight - 2006 - Bulletin of Symbolic Logic 12 (2):191-218.
  13.  44
    Computable Trees of Scott Rank [Image] , and Computable Approximation.Wesley Calvert, Julia F. Knight & Jessica Millar - 2006 - Journal of Symbolic Logic 71 (1):283 - 298.
    Makkai [10] produced an arithmetical structure of Scott rank $\omega _{1}^{\mathit{CK}}$. In [9]. Makkai's example is made computable. Here we show that there are computable trees of Scott rank $\omega _{1}^{\mathit{CK}}$. We introduce a notion of "rank homogeneity". In rank homogeneous trees, orbits of tuples can be understood relatively easily. By using these trees, we avoid the need to pass to the more complicated "group trees" of [10] and [9]. Using the same kind of trees, we obtain one of rank (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  14.  9
    Prime and Atomic Models.Julia F. Knight - 1978 - Journal of Symbolic Logic 43 (3):385-393.
  15.  7
    Constructions by Transfinitely Many Workers.Julia F. Knight - 1990 - Annals of Pure and Applied Logic 48 (3):237-259.
  16.  22
    Requirement Systems.Julia F. Knight - 1995 - Journal of Symbolic Logic 60 (1):222-245.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  17.  27
    Minimality and Completions of PA.Julia F. Knight - 2001 - Journal of Symbolic Logic 66 (3):1447-1457.
  18.  15
    Generic Expansions of Structures.Julia F. Knight - 1973 - Journal of Symbolic Logic 38 (4):561-570.
  19.  18
    Degrees of Types and Independent Sequences.Julia F. Knight - 1983 - Journal of Symbolic Logic 48 (4):1074-1081.
  20.  8
    A Complete $L{Omega 1omega}$-Sentence Characterizing $Mathbf{Aleph}1$.Julia F. Knight - 1977 - Journal of Symbolic Logic 42 (1):59-62.
  21.  10
    Computing Strength of Structures Related to the Field of Real Numbers.Gregory Igusa, Julia F. Knight & Noah David Schweber - 2017 - Journal of Symbolic Logic 82 (1):137-150.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  22.  10
    Models and Types of Peano's Arithmetic.Haim Gaifman, Julia F. Knight, Fred G. Abramson & Leo A. Harrington - 1983 - Journal of Symbolic Logic 48 (2):484-485.
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  23.  7
    Autism, Expert Discourses, and Subjectification: A Critical Examination of Applied Behavioural Therapies.Julia F. Gruson-Wood - 2016 - Studies in Social Justice 10 (1):38-58.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  24.  84
    Barwise: Infinitary Logic and Admissible Sets.H. Jerome Keisler & Julia F. Knight - 2004 - Bulletin of Symbolic Logic 10 (1):4-36.
  25.  13
    Recursive Structures and Ershov's Hierarchy.Christopher J. Ash & Julia F. Knight - 1996 - Mathematical Logic Quarterly 42 (1):461-468.
    Ash and Nerode [2] gave natural definability conditions under which a relation is intrinsically r. e. Here we generalize this to arbitrary levels in Ershov's hierarchy of Δmath image sets, giving conditions under which a relation is intrinsically α-r. e.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  26.  44
    Can Neuroscience Contribute to Practical Ethics? A Critical Review and Discussion of the Methodological and Translational Challenges of the Neuroscience of Ethics.Eric Racine, Veljko Dubljević, Ralf J. Jox, Bernard Baertschi, Julia F. Christensen, Michele Farisco, Fabrice Jotterand, Guy Kahane & Sabine Müller - 2017 - Bioethics 31 (5):328-337.
    Neuroethics is an interdisciplinary field that arose in response to novel ethical challenges posed by advances in neuroscience. Historically, neuroethics has provided an opportunity to synergize different disciplines, notably proposing a two-way dialogue between an ‘ethics of neuroscience’ and a ‘neuroscience of ethics’. However, questions surface as to whether a ‘neuroscience of ethics’ is a useful and unified branch of research and whether it can actually inform or lead to theoretical insights and transferable practical knowledge to help resolve ethical questions. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  27.  3
    Opioid-Related Legislation in Kentucky and West Virginia: Assessing Policy Impact.Julia F. Costich & Dana Quesinberry - 2019 - Journal of Law, Medicine and Ethics 47 (S2):36-38.
    Kentucky and West Virginia are among the states most severely affected by opioid poisonings and deaths. The legislatures of both states have enacted a broad range of bills intended to address related issues. We present an overview of legislation enacted in 2017 and 2018, along with an approach to analysis of practitioner response to one type of legislation.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  28.  3
    A Practice-Inspired Mindset for Researching the Psychophysiological and Medical Health Effects of Recreational Dance.Julia F. Christensen, Meghedi Vartanian, Luisa Sancho-Escanero, Shahrzad Khorsandi, S. H. N. Yazdi, Fahimeh Farahi, Khatereh Borhani & Antoni Gomila - 2021 - Frontiers in Psychology 11.
    “Dance” has been associated with many psychophysiological and medical health effects. However, varying definitions of what constitute “dance” have led to a rather heterogenous body of evidence about such potential effects, leaving the picture piecemeal at best. It remains unclear what exact parameters may be driving positive effects. We believe that this heterogeneity of evidence is partly due to a lack of a clear definition of dance for such empirical purposes. A differentiation is needed between the effects on the individual (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29.  42
    Preface to Meta2physics: New Perspectives on Analytic & Naturalised Metaphysics of Science.Julia F. Göhner, Kristina Engelhard & Markus Schrenk - 2018 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 49 (2):159-160.
    Metaphysics, traditionally conceived, has often been defined as the inquiry into what lies beyond or is independent of experience, but which nonetheless pertains to the fundamental structure of reality. Thus understood, metaphysics produces claims that are not empirically testable. The 20th century logical empiricists famously—and ferociously—criticised metaphysics on these grounds as being devoid of cognitive content. Despite logical empiricism’s seminal role in the genesis and propagation of the analytic tradition in academic philosophy, metaphysics has made a remarkable comeback during the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  30.  7
    Preface.Julia F. Göhner, Kristina Engelhard & Markus Schrenk - 2018 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 49 (2):159-160.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  31.  14
    A Complete Theory with Arbitrarily Large Minimality Ranks.Robert E. Woodrow & Julia F. Knight - 1983 - Journal of Symbolic Logic 48 (2):321-328.
    An example is given of a complete theory with minimal models of arbitrarily large minimality rank.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  32.  40
    Isomorphism Relations on Computable Structures.Ekaterina B. Fokina, Sy-David Friedman, Valentina Harizanov, Julia F. Knight, Charles Mccoy & Antonio Montalbán - 2012 - Journal of Symbolic Logic 77 (1):122-132.
    We study the complexity of the isomorphism relation on classes of computable structures. We use the notion of FF-reducibility introduced in [9] to show completeness of the isomorphism relation on many familiar classes in the context of all ${\mathrm{\Sigma }}_{1}^{1}$ equivalence relations on hyperarithmetical subsets of ω.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  33.  22
    Sequences of N-Diagrams.Valentina S. Harizanov, Julia F. Knight & Andrei S. Morozov - 2002 - Journal of Symbolic Logic 67 (3):1227-1247.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  34.  9
    Algebraic Independence.Julia F. Knight - 1981 - Journal of Symbolic Logic 46 (2):377-384.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  35.  4
    An Inelastic Model with Indiscernibles.Julia F. Knight - 1978 - Journal of Symbolic Logic 43 (2):331-334.
  36.  14
    Additive Structure in Uncountable Models for a Fixed Completion of P.Julia F. Knight - 1983 - Journal of Symbolic Logic 48 (3):623-628.
  37.  5
    Coding in Graphs and Linear Orderings.Julia F. Knight, Alexandra A. Soskova & Stefan V. Vatev - 2020 - Journal of Symbolic Logic 85 (2):673-690.
    There is a Turing computable embedding $\Phi $ of directed graphs $\mathcal {A}$ in undirected graphs. Moreover, there is a fixed tuple of formulas that give a uniform effective interpretation; i.e., for all directed graphs $\mathcal {A}$, these formulas interpret $\mathcal {A}$ in $\Phi $. It follows that $\mathcal {A}$ is Medvedev reducible to $\Phi $ uniformly; i.e., $\mathcal {A}\leq _s\Phi $ with a fixed Turing operator that serves for all $\mathcal {A}$. We observe that there is a graph G (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  38.  4
    Complete Types and the Natural Numbers.Julia F. Knight - 1973 - Journal of Symbolic Logic 38 (3):413-415.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  39.  31
    In Memoriam: Christopher John Ash.Julia F. Knight - 1995 - Bulletin of Symbolic Logic 1 (2):202.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark  
  40.  17
    Jon Barwise and John Schlipf. An Introduction to Recursively Saturated and Resplendent Models. The Journal of Symbolic Logic, Vol. 41 , Pp. 531–536.Julia F. Knight - 1982 - Journal of Symbolic Logic 47 (2):440.
  41.  16
    John Gregory. Uncountable Models and Infinitary Elementary Extensions. The Journal of Symbolic Logic, Vol. 38 , Pp. 460–470.Julia F. Knight - 1982 - Journal of Symbolic Logic 47 (2):438-439.
  42.  66
    Meeting of the Association for Symbolic Logic: San Antonio, 1987.Julia F. Knight - 1988 - Journal of Symbolic Logic 53 (3):1000-1006.
  43. Meeting of the Association for Symbolic Logic.Julia F. Knight - 1988 - Journal of Symbolic Logic 53 (3):1000-1006.
  44.  22
    Omitting Types in Set Theory and Arithmetic.Julia F. Knight - 1976 - Journal of Symbolic Logic 41 (1):25-32.
  45.  6
    Review: Jon Barwise, John Schlipf, An Introduction to Recursively Saturated and Resplendent Models. [REVIEW]Julia F. Knight - 1982 - Journal of Symbolic Logic 47 (2):440-440.
  46.  5
    Review: John Gregory, Uncountable Models and Infinitary Elementary Extensions. [REVIEW]Julia F. Knight - 1982 - Journal of Symbolic Logic 47 (2):438-439.
  47.  5
    Review: J. P. Ressayre, Models with Compactness Properties Relative to an Admissible Language. [REVIEW]Julia F. Knight - 1982 - Journal of Symbolic Logic 47 (2):439-440.
  48.  5
    Ressayre J. P.. Models with Compactness Properties Relative to an Admissible Language. Annals of Mathematical Logic, Vol. 11 No. 1 , Pp. 31–55. [REVIEW]Julia F. Knight - 1982 - Journal of Symbolic Logic 47 (2):439-440.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  49.  21
    Skolem Functions and Elementary Embeddings.Julia F. Knight - 1977 - Journal of Symbolic Logic 42 (1):94-98.
  50.  14
    Saturation of Homogeneous Resplendent Models.Julia F. Knight - 1986 - Journal of Symbolic Logic 51 (1):222-224.
1 — 50 / 1000