Search results

{{Short description|A normal form for modal logic formulae}} ....com/chapter/10.1007/3-540-52335-9_55}}</ref> is a normal form for [[modal logic]] formulae. ...

In [[mathematical logic]] the '''Löwenheim number''' of an [[abstract logic]] is the smallest [[cardinal number]] for which a weak downward [[Löwenheim == Abstract logic == ...

...–81 |language=en}}</ref> It is the most widely known example of duality in logic.<ref name=":0" /> The duality consists in these [[metalogic]]al theorems: ...logic|classical]] propositional logic, the connectives for [[Conjunction (logic)|conjunction]] and [[Logical disjunction|disjunction]] can be defined in te ...

...nt properties of rewriting systems like [[Normal form (abstract rewriting)|normal form]]s, [[Termination (term rewriting)|termination]], and various notions == Normal forms == ...

...ky |editor2=Dov M. Gabbay |editor3=Thomas S. E. Maibaum |title=Handbook of Logic in Computer Science|year=1995|volume=Vol. 3: Semantic structures|publisher= The [[Signature (logic)|signature]] of an algebraic specification defines its formal syntax. The w ...

In [[Boolean algebra (logic)|Boolean algebra]], a '''parity function''' is a [[Boolean function]] whos ...p;&minus;&nbsp;1</sup> [[monomial]]s of length ''n'' and all [[conjunctive normal form]]s have the maximal number of 2<sup>&nbsp;''n''&nbsp;&minus;&nbsp;1</ ...

...ed as the difference in the [[Witt ring (forms)|Witt ring]] of the ternary forms attached to the imaginary subspaces of ''A'' and ''B''.{{sfn|Knus|Merkurjev ...| last=Albert | first=A.Adrian | author-link=Abraham Adrian Albert | title=Normal division algebras of degree four over an algebraic field | zbl=0004.10002 | ...

...da calculus]] that allows an arbitrary number of [[Structure (mathematical logic)#Many-sorted structures|sorts]] and dependencies between any of these. The ...f Torino]] | year = 1990 }}</ref> Berardi defined a cube of [[constructive logic]]s akin to the lambda cube (these specifications are non-dependent). A modi ...

...0rLN_tcvD-IC&pg=PT149|pages=149–157}}.</ref> They have also been called '''normal spanning trees''', especially in the context of infinite graphs.<ref name=" ...graph]]. A characterization of Trémaux trees in the monadic second-order [[logic of graphs]] allows graph properties involving [[orientation (graph theory)| ...

...recursive function. More specifically it aims to define rigorously [[head normal form]] reduction of a [[Lambda calculus|lambda term]] using [[call-by-name] == Call by name and head normal form reduction == ...

{{Short description|Quantum logic gate}} ...lementation of the [[Controlled NOT gate|controlled-NOT]] (CNOT) [[quantum logic gate]] using [[ion trap|cold trapped ions]] that was proposed by [[Juan Ign ...

...n addition the normal forms of the strategy must be the same as the normal forms of the original rewriting system, i.e. for all <math>a</math>, there exists ...m rewriting systems, meaning that these strategies will eventually reach a normal form if it exists, even when performing (finitely many) arbitrary reduction ...

...oughness or channel slope. During uniform flow, the flow depth is known as normal depth (yn). This depth is analogous to the terminal velocity of an object i ...here normal depth is subcritical (yn > yc) while steep reaches occur where normal depth is supercritical (yn<yc). The transitions are classified by zone. (Se ...

...m of proof-theoretic ordinal functions |journal=Annals of Pure and Applied Logic |language=en |volume=32 |pages=195–207 |doi=10.1016/0168-0072(86)90052-7|do == Fundamental sequences and normal form for Buchholz's function == ...

|series=Studies in Logic and the Foundations of Mathematics | url = https://www.cse.chalmers.se/research/group/logic/TypesSS05/Extra/geuvers.pdf ...

...mb|right|350px|Stochastic process with random increments from a standard [[normal distribution]].]] ...ysis]] are extensions of the concept of [[randomness]] as modeled by the [[normal distribution]]. These seven states were first introduced by [[Benoît Mandel ...

...fied]] [[propositional logic]] (also known as [[Second-order propositional logic]]) where every variable is quantified (or [[Bound variable|bound]]), using QBF formulas have a number of useful canonical forms. For example, it can be shown that there is a [[polynomial-time many-one re ...

...which identifies λ-terms modulo convertible terms, an example being [[beta normal form]]. ...as previously described which allows Scott's topology to be applicable to logic and recursive function theory. Scott approaches his derivation using a [[co ...

...mour|publisher=MIT Press|year=1988}}</ref> These perceptrons were modified forms of the perceptrons introduced by Rosenblatt in 1958. They consisted of a re ...ournal |last=Minnick |first=Robert C. |date=March 1961 |title=Linear-Input Logic |url=https://ieeexplore.ieee.org/document/5219146 |journal=IEEE Transaction ...

...or its properties. For example, the [[Euclidean group]] is noted for the [[normal subgroup]] of [[translation (geometry)|translation]]s. In the plane, a dire ...was at this congress that [[Bertrand Russell]] was exposed to continental logic through Peano. In his book [[Principles of Mathematics]] (1903), Russell co ...