function symbol
111Arithmetical hierarchy — In mathematical logic, the arithmetical hierarchy, arithmetic hierarchy or Kleene hierarchy classifies certain sets based on the complexity of formulas that define them. Any set that receives a classification is called arithmetical. The… …
112Tarski's undefinability theorem — Tarski s undefinability theorem, stated and proved by Alfred Tarski in 1936, is an important limitative result in mathematical logic, the foundations of mathematics, and in formal semantics. Informally, the theorem states that arithmetical truth… …
113Orthogonality (term rewriting) — Orthogonality as a property of term rewriting systems describes where the reduction rules of the system are all left linear, that is each variable occurs only once on the left hand side of each reduction rule, and there is no overlap between them …
114Herbrandization — The Herbrandization of a logical formula (named after Jacques Herbrand) is a construction that is dual to the Skolemization of a formula. Thoralf Skolem had considered the Skolemizations of formulas in prenex form as part of his proof of the… …
115Galois connection — In mathematics, especially in order theory, a Galois connection is a particular correspondence between two partially ordered sets (posets). Galois connections generalize the correspondence between subgroups and subfields investigated in Galois… …
116Tefkat — is a Model Transformation Language and a model transformation engine. The language is based on F logic and the theory of stratified logic programs. The engine is an Eclipse plug in for the Eclipse Modeling Framework (EMF). History Tefkat was one… …
117Herbrand interpretation — In mathematical logic, a Herbrand interpretation is an interpretation in which all constants and function symbols are assigned very simple meanings. Specifically, every constant is interpreted as itself, and every function symbol is interpreted… …
118interpretation — (logic) Informally, an intepretation of a logical system assigns meaning or semantic value to the formulae and their elements. More formally, if we consider a language whose non logical terms include names, function symbols, predicate letters,… …
119Substructure — In universal algebra, an (induced) substructure or (induced) subalgebra is a structure whose domain is a subset of that of a bigger structure, and whose functions and relations are the traces of the functions and relations of the bigger structure …
120Predicate logic — In mathematical logic, predicate logic is the generic term for symbolic formal systems like first order logic, second order logic, many sorted logic or infinitary logic. This formal system is distinguished from other systems in that its formulas… …
