8 found
Order:
Disambiguations
Lars Kristiansen [8]Lars J. Kristiansen [1]
  1.  50
    The Bullshit Doctrine: Fabrications, Lies, and Nonsense in the Age of Trump.Lars J. Kristiansen & Bernd Kaussler - 2018 - Informal Logic 38 (1):13-52.
    Guided by the concept of bullshit, broadly defined as a deceptive form of rhetoric intended to distract and/or persuade, we examine how fabrications and false statements— when crafted and distributed by the president of the United States—impact not only foreign policy making and implementation but also erode democratic norms. Unconstrained by reality, and seemingly driven more by celebrity and showmanship than a genuine desire to govern, we argue that President Trump’s penchant for bullshit is part of a concerted strategy to (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  15
    Streamlined Subrecursive Degree Theory.Lars Kristiansen, Jan-Christoph Schlage-Puchta & Andreas Weiermann - 2012 - Annals of Pure and Applied Logic 163 (6):698-716.
  3.  15
    Subrecursive Degrees and Fragments of Peano Arithmetic.Lars Kristiansen - 2001 - Archive for Mathematical Logic 40 (5):365-397.
    Let T 0?T 1 denote that each computable function, which is provable total in the first order theory T 0, is also provable total in the first order theory T 1. Te relation ? induces a degree structure on the sound finite Π2 extensions of EA (Elementary Arithmetic). This paper is devoted to the study of this structure. However we do not study the structure directly. Rather we define an isomorphic subrecursive degree structure <≤,?>, and then we study <≤,?> by (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  4.  18
    A Jump Operator on Honest Subrecursive Degrees.Lars Kristiansen - 1998 - Archive for Mathematical Logic 37 (2):105-125.
    It is well known that the structure of honest elementary degrees is a lattice with rather strong density properties. Let $\mbox{\bf a} \cup \mbox{\bf b}$ and $\mbox{\bf a} \cap \mbox{\bf b}$ denote respectively the join and the meet of the degrees $\mbox{\bf a}$ and $\mbox{\bf b}$ . This paper introduces a jump operator ( $\cdot'$ ) on the honest elementary degrees and defines canonical degrees $\mbox{\bf 0},\mbox{\bf 0}', \mbox{\bf 0}^{\prime \prime },\ldots$ and low and high degrees analogous to the corresponding (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  5.  1
    First-order concatenation theory with bounded quantifiers.Lars Kristiansen & Juvenal Murwanashyaka - forthcoming - Archive for Mathematical Logic:1-28.
    We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.
    No categories
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  6.  40
    S. Barry Cooper, Computability Theory.Lars Kristiansen - 2007 - Studia Logica 86 (1):145-146.
  7.  2
    Degrees of Total Algorithms Versus Degrees of Honest Functions.Lars Kristiansen - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 422--431.
    Direct download  
     
    Export citation  
     
    Bookmark  
  8.  6
    Computability Theory.Lars Kristiansen - 2007 - Studia Logica 86 (1):145-146.
    Direct download  
     
    Export citation  
     
    Bookmark   12 citations