Algebraic Logic Functional programming language — also known as ALF is a programming language which combines functional and logic programming techniques. Its foundation is Horn clause logic with equality which consists of predicates and Horn clauses for logic programming, and functions and… … Wikipedia
Kripke semantics — (also known as relational semantics or frame semantics, and often confused with possible world semantics) is a formal semantics for non classical logic systems created in the late 1950s and early 1960s by Saul Kripke. It was first made for modal… … Wikipedia
Operational semantics — In computer science, operational semantics is a way to give meaning to computer programs in a mathematically rigorous way. Operational semantics are classified into two categories: structural operational semantics (or small step semantics)… … Wikipedia
Abstract algebraic logic — In mathematical logic, abstract algebraic logic (AAL) studies the ways in which classes of algebras may be associated with logical systems, and how these classes of algebras interact with logical systems.OverviewThe archetypal association of this … Wikipedia
Action semantics — is a framework for the formal specification of semantics of programming languages invented by David Watt and Peter D. Mosses. It is a mixture of denotational, operational and algebraic semantics.Action Semantics aims to be pragmatic. Action… … Wikipedia
Axiomatic semantics — is an approach based on mathematical logic to proving the correctness of computer programs. It is closely related to Hoare logic. Axiomatic semantics define the meaning of a command in a program by describing its effect on assertions about the… … Wikipedia
Denotational semantics — In computer science, denotational semantics (initially known as mathematical semantics or Scott–Strachey semantics) is an approach to formalizing the meanings of programming languages by constructing mathematical objects (called denotations)… … Wikipedia
Communicating sequential processes — In computer science, Communicating Sequential Processes (CSP) is a formal language for describing patterns of interaction in concurrent systems.[1] It is a member of the family of mathematical theories of concurrency known as process algebras, or … Wikipedia
T-norm fuzzy logics — are a family of non classical logics, informally delimited by having a semantics which takes the real unit interval [0, 1] for the system of truth values and functions called t norms for permissible interpretations of conjunction. They are mainly … Wikipedia
Monoidal t-norm logic — Monoidal t norm based logic (or shortly MTL), the logic of left continuous t norms, is one of t norm fuzzy logics. It belongs to the broader class of substructural logics, or logics of residuated lattices;[1] it extends the logic of commutative… … Wikipedia
