intuitionistic
71Sequent — In proof theory, a sequent is a formalized statement of provability that is frequently used when specifying calculi for deduction. In the sequent calculus, the name sequent is used for the construct which can be regarded as a specific kind of… …
72Modal logic — is a type of formal logic that extends classical propositional and predicate logic to include operators expressing modality. Modals words that express modalities qualify a statement. For example, the statement John is happy might be qualified by… …
73Dialetheism — is the view that some statements can be both true and false simultaneously. More precisely, it is the belief that there can be a true statement whose negation is also true. Such statements are called true contradictions , or dialetheia.… …
74List of functional programming topics — This is a list of functional programming topics. Contents 1 Foundational concepts 2 Lambda calculus 3 Combinatory logic 4 Intuitionistic logic …
75Giorgi Japaridze — is a logician, at Villanova University in Villanova, Pennsylvania. In the past his contributions were primarily into the areas of provability logic and interpretability logic. Currently he is best known for his work on computability logic… …
76Logics for computability — are formulations of logic whichcapture some aspect of computability as a basic notion. This usually involves a mixof special logical connectives as well as semantics which explains how the logic is to be interpreted in a computational… …
77Inhabited set — In constructive mathematics, a set A is inhabited if there exists an element ain A. In classical mathematics, this is the same as the set being nonempty; however, this equivalence is not valid in intuitionistic logic. Comparison with nonempty… …
78Bar induction — is a reasoning principle used in intuitionistic mathematics, introduced by L.E.J. Brouwer.It is useful in giving constructive versions of classical results.It is based on an inductive argument.The goal of the principle is to prove properties of… …
79Interpretation (logic) — An interpretation is an assignment of meaning to the symbols of a formal language. Many formal languages used in mathematics, logic, and theoretical computer science are defined in solely syntactic terms, and as such do not have any meaning until …
80Markov's principle — Markov s principle, named after Andrey Markov Jr, is a classical tautology that is not intuitionistically valid but that may be justified by constructive means. There are many equivalent formulations of Markov s principle. Contents 1 Statements… …
