subterm
Look at other dictionaries:
Free variables and bound variables — In mathematics, and in other disciplines involving formal languages, including mathematical logic and computer science, a free variable is a notation that specifies places in an expression where substitution may take place. The idea is related to … Wikipedia
Intensional logic — embraces the logical study of intensional languages. While in extensional languages all of their functors are extensional (and that suffices in many formal languages developed for formalizing special fields in mathematics or science),… … Wikipedia
Binary combinatory logic — (BCL) is a formulation of combinatory logic using only the symbols 0 and 1. BCL has applications in the theory of program size complexity (Kolmogorov complexity). DefinitionyntaxBackus ndash;Naur form: * ::= 00 | 01 | 1 emanticsThe denotational… … Wikipedia
ASF+SDF Meta Environment — Infobox Software name = ASF+SDF Meta Environment caption = developer = SEN1 [http://www.cwi.nl/htbin/sen1/twiki/bin/view/SEN1/] group at the CWI [http://www.cwi.nl] latest release version = 2.0.1 latest release date = 08 September 2008 latest… … Wikipedia
Special municipality (Republic of China) — This article is part of a series on the Administrative divisions of the Republic of China (Taiwan) In effect 1st Provinces (省 shěng) (streamlined) … Wikipedia
Unification (computer science) — Unification, in computer science and logic, is an algorithmic process by which one attempts to solve the satisfiability problem. The goal of unification is to find a substitution which demonstrates that two seemingly different terms are in fact… … Wikipedia
