logical morphism
Смотреть что такое "logical morphism" в других словарях:
Heyting algebra — In mathematics, Heyting algebras are special partially ordered sets that constitute a generalization of Boolean algebras, named after Arend Heyting. Heyting algebras arise as models of intuitionistic logic, a logic in which the law of excluded… … Wikipedia
Adjoint functors — Adjunction redirects here. For the construction in field theory, see Adjunction (field theory). For the construction in topology, see Adjunction space. In mathematics, adjoint functors are pairs of functors which stand in a particular… … Wikipedia
Category theory — In mathematics, category theory deals in an abstract way with mathematical structures and relationships between them: it abstracts from sets and functions to objects and morphisms . Categories now appear in most branches of mathematics and in… … Wikipedia
Curry–Howard correspondence — A proof written as a functional program: the proof of commutativity of addition on natural numbers in the proof assistant Coq. nat ind stands for mathematical induction, eq ind for substitution of equals and f equal for taking the same function… … Wikipedia
Institution (computer science) — The notion of institution has been created by Joseph Goguen and Rod Burstall in the late 1970 sin order to deal with the population explosion among the logical systems used in computer science . The notion tries to capture the essence of the… … Wikipedia
Equivalence relation — In mathematics, an equivalence relation is a binary relation between two elements of a set which groups them together as being equivalent in some way. Let a , b , and c be arbitrary elements of some set X . Then a b or a ≡ b denotes that a is… … Wikipedia
Category (mathematics) — In mathematics, a category is an algebraic structure that comprises objects that are linked by arrows . A category has two basic properties: the ability to compose the arrows associatively and the existence of an identity arrow for each object. A … Wikipedia
Domain of a function — Venn diagram showing f, a function from domain X to codomain Y. The smaller oval inside Y is the image of f, sometimes called the range of f. In mathematics, the domain of definition or simply the domain of a function is the set of input or… … Wikipedia
Functor — For functors as a synonym of function objects in computer programming to pass function pointers along with its state, see function object. For the use of the functor morphism presented here in functional programming see also the fmap function of… … Wikipedia
Peano axioms — In mathematical logic, the Peano axioms, also known as the Dedekind Peano axioms or the Peano postulates, are a set of axioms for the natural numbers presented by the 19th century Italian mathematician Giuseppe Peano. These axioms have been used… … Wikipedia
Propositional calculus — In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is a formal system in which formulas of a formal language may be interpreted as representing propositions. A system of inference rules… … Wikipedia
