Results for 'prolog'

5 found
Order:
  1.  76
    The Prolog Inference Model refutes Tarski Undefinability.Pete Olcott - manuscript
    The generalized conclusion of the Tarski and Gödel proofs: All formal systems of greater expressive power than arithmetic necessarily have undecidable sentences. Is not the immutable truth that Tarski made it out to be it is only based on his starting assumptions. -/- When we reexamine these starting assumptions from the perspective of the philosophy of logic we find that there are alternative ways that formal systems can be defined that make undecidability inexpressible in all of these formal systems.
    Download  
     
    Export citation  
     
    Bookmark  
  2. Prolog detects pathological self reference in the Gödel sentence.P. Olcott - manuscript
    This sentence G ↔ ¬(F ⊢ G) and its negation G ↔ ~(F ⊢ ¬G) are shown to meet the conventional definition of incompleteness: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ (T ⊬ ¬φ)). They meet conventional definition of incompleteness because neither the sentence nor its negation is provable in F (or any other formal system). -- .
    Download  
     
    Export citation  
     
    Bookmark  
  3. Zum Namenstag von Kant. Epilog zu einem Prolog von Kuehn.Gerhard Kaidisch - manuscript
    Zum Kant-Jahr: Manfed Kühns meisterhafte Biographie so preist der Verlag C. H. Beck im Buchumschlag seine 2004 in fünfter Auflage erschienene Übersetzung von Manfred Kuehns Kant. A Biography. Cambridge University Press 2001 an. Nun, 2018, habe ich eben diese Jubiläumsausgabe zu Weihnachten, dem Fest der Geburt des Immanuel, geschenkt bekommen. Kant wurde am 22. April 1724 in Königsberg geboren und starb dort am 12. Februar 1804. 2018 kann kaum oder gar nicht als Kant-Jahr gelten. Doch ein katholischer Kalender verbindet mit (...)
    Download  
     
    Export citation  
     
    Bookmark  
  4.  56
    Information-oriented computation with BABY-SIT.Erkan Tin & Varol Akman - 1996 - In Jerry Seligman & Dag Westerståhl (eds.), Logic, Language and Computation, Volume 1. Stanford, CA: Center for the Study of Language and Information Publications. pp. 19-34.
    While situation theory and situation semantics provide an appropriate framework for a realistic model-theoretic treatment of natural language, serious thinking on their 'computational' aspects has only recently started. Existing proposals mainly offer a Prolog- or Lisp-like programming environment with varying degrees of divergence from the ontology of situation theory. In this paper, we introduce a computational medium (called BABY-SIT) based on situations. The primary motivation underlying BABY-SIT is to facilitate the development and testing of programs in domains ranging from (...)
    Download  
     
    Export citation  
     
    Bookmark  
  5.  55
    BABY-SIT: a computational medium based on situations.Erkan Tin & Varol Akman - 1993 - In Paul Dekker & Martin Stokhof (eds.), 9th Amsterdam Colloquium. Amsterdam, The Netherlands: Institute for Logic, Language and Computation.
    While situation theory and situation semantics provide an appropriate framework for a realistic model-theoretic treatment of natural language, serious thinking on their 'computational' aspects has just started. Existing proposals mainly offer a Prolog- or Lisp-like programming environment with varying degrees of divergence from the ontology of situation theory. In this paper, we introduce a computational medium (called BABY-SIT) based on situations. The primary motivation underlying BABY-SIT is to facilitate the development and testing of programs in domains ranging from linguistics (...)
    Download  
     
    Export citation  
     
    Bookmark