explicit sequent
Смотреть что такое "explicit sequent" в других словарях:
Sequent calculus — In proof theory and mathematical logic, sequent calculus is a family of formal systems sharing a certain style of inference and certain formal properties. The first sequent calculi, systems LK and LJ, were introduced by Gerhard Gentzen in 1934 as … Wikipedia
Natural deduction — In logic and proof theory, natural deduction is a kind of proof calculus in which logical reasoning is expressed by inference rules closely related to the natural way of reasoning. This contrasts with the axiomatic systems which instead use… … Wikipedia
Admissible rule — In logic, a rule of inference is admissible in a formal system if the set of theorems of the system is closed under the rule. The concept of an admissible rule was introduced by Paul Lorenzen (1955).DefinitionsThe concept of admissibility, as… … 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
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
Symmetric multiprocessing — In computing, symmetric multiprocessing (SMP) involves a multiprocessor computer hardware architecture where two or more identical processors are connected to a single shared main memory and are controlled by a single OS instance. Most common… … Wikipedia
Cybersex — An Internet user engaged in cybersex, using a webcam. Cybersex, also called computer sex, Internet sex, netsex, mudsex, TinySex and, colloquially, cybering, is a virtual sex encounter in which two or more persons connected remotely via computer… … Wikipedia
Monotonicity of entailment — is a property of many logical systems that states that the hypotheses of any derived fact may be freely extended with additional assumptions. In sequent calculi this property can be captured by an inference rule called weakening, or sometimes… … Wikipedia
Non-Uniform Memory Access — (NUMA) is a computer memory design used in Multiprocessing, where the memory access time depends on the memory location relative to a processor. Under NUMA, a processor can access its own local memory faster than non local memory, that is, memory … Wikipedia
Read-copy-update — (RCU) is an operating system kernel technology for improving performance on computers with more than one CPU.More technically it is a synchronization mechanism which can sometimes be used as an alternative to a readers writer lock. It allows… … Wikipedia
Generalization (logic) — Generalization is an inference rule of predicate calculus which states that:: If vdash P(x) is true (valid) then so is vdash forall x , P(x) . Generalization can be abbreviated as GEN. The inference rule can be summarized as the sequent: P(x)… … Wikipedia
