See this document in CiteSeerX!

A Note on First Order Unification (2000)  (Make Corrections)  
Rodrigo Readi Nasser



  Home/Search   Context   Related

 
View or download:
cis.unimuenchen.d...Bericht00126.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cis.unimuenche...ISPublikationen (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this article a language L for the predicate calculus whose only predicate symbol = is the 2-ary one for the equality and whose function symbols are a 2-ary one ap for application together with a set of 0-ary symbols divided into ground symbols and unknowns. The unknowns correspond to the function letters of [2], page 263, while the ground symbols to its function symbols. We remark: unknowns are function symbols of the language L that should not be confused with variables of L. Usually, we use... (Update)

Active bibliography (related documents):   More   All
0.1:   What Is an Algorithm? - Moschovakis (2001)   (Correct)
0.1:   Sense and Denotation as Algorithm and Value - Moschovakis (1990)   (Correct)
0.1:   Computability and Recursion - Soare (1996)   (Correct)

System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text:   More   All
0.2:   A Meta-Learning Approach to Ground Symbols from.. - Bredeche.. (2002)   (Correct)
0.1:   mj-Prolog - 1. Proof Theoretical Foundations - - Nasser (1999)   (Correct)
0.0:   A Fuzzy Dynamic Model Based State Estimator - Layne, Passino   (Correct)

BibTeX entry:   (Update)

@misc{ nasser-note,
  author = "Rodrigo Readi Nasser",
  title = "A Note on First Order Unification",
  url = "citeseer.ist.psu.edu/nasser00note.html" }
Citations (may not include all citations):
116   Natural Deduction (context) - Prawitz - 1965
88   Basic Proof Theory (context) - Troelstra, Schwichtenberg - 1996
87   An Efficient Unification Algorithm (context) - und, Montanari - 1982
62   Term Rewriting Systems (context) - Klop - 1992
14   Transactions of the American Mathematical Society (context) - Kleene, Predicates - 1943
1   Proof Theoretical Foundations (context) - Nasser, mj-Prolog

Documents on the same site (http://www.cis.uni-muenchen.de/CISPublikationen.html):   More
Bounded Fixed-Point Definability and Tabular Recognition of.. - Leiß   (Correct)
Extending the Type Checker of SML by Polymorphic Recursion: A.. - Emms, Leiß (1997)   (Correct)
Combining Recursive and Dynamic Types - Leiss   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC