scientific article; zbMATH DE number 784358

zbMath0823.03015MaRDI QIDQ4843402

René Lalement

Publication date: 13 August 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

reductionequational logicdecidabilitynatural deductionresolutionrewriting systemslogic programmingfunctional programmingcomputabilitymodularitylambda-calculussemantics of computation

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42) Logic programming (68N17) General topics in the theory of software (68N01) Equational classes, universal algebra in model theory (03C05) Combinatory logic and lambda calculus (03B40) Basic properties of first-order languages and structures (03C07)

Related Items (5)

The length of an intersection ⋮ A fuzzy language. ⋮ A proof-theoretic foundation of abortive continuations ⋮ Confluence theory for graphs ⋮ Using well-founded relations for proving operational termination

This page was built for publication: