Search results

{{Short description|Rule of inference in predicate logic}} | field = [[Predicate logic]] ...

...''' is for simultaneously declaring some inductive type and some inductive predicate over this type. ...the type''' <math>A : \mathsf{Type}</math> '''are allowed to refer to the predicate''' <math>B : A \to \mathsf{Type}</math>. ...

{{Short description|Rule of inference in predicate logic}} | field = [[Predicate logic]] ...

{{short description|Algorithm in modal logic}} ...tion|accessible worlds]]. The [[logical connective]]s from [[propositional logic]] remain untouched and the modal operators are transformed into first-order ...

|known_for=Coining the term [[free logic]] ...versity of Salzburg]]. He has written extensively on the subject of [[free logic]], a term which he coined.<ref>{{Cite journal ...

...assigned to these variables, the expression becomes a fuzzy [[Proposition (logic)|proposition]].<ref name="Zadeh 1975">Zadeh, L. A. (1975). Calculus of fuzz ...t interval]] <math display="inline">[0,1]</math>. The fuzzy classification predicate <math display="inline">\tilde{\Pi} _{\tilde{C}}(i)</math> corresponds to th ...

In [[mathematical logic]], the '''Hilbert–Bernays provability conditions''', named after [[David Hi ...teness theorem]]. They are also closely related to axioms of [[provability logic]]. ...

...=Rescher |first1=N. |title=Vagueness: A Variant Approach |journal=Informal Logic |date=2008 |volume=28 |issue=4 |pages=282–294 |doi=10.22329/il.v28i4.2853|d [[Category:Logic]] ...

{{Short description|Logic for mathematics}} '''Algorithmic logic''' is a calculus of programs that allows the expression of [[semantic prope ...

...h inductive definitions |journal=International Conference on Computational Logic |date=2000 |pages=703–717 |doi= |arxiv=cs/0003019 |bibcode=2000cs........30 ...ve Logic Programming: Theory, Systems, and Applications |chapter=Predicate logic as a modeling language: The IDP system |date=2018 |pages=279–323 |doi=10.11 ...

...match any and all partitions of the actual value that unify. Thus, if the predicate is <math>f(xy)</math> and the actual pattern is <math>f(ab)</math>, there a * <math>f(x_1, \ldots, x_n)</math>, a predicate of arity n, ...

...eory) |classes]] are described by a property of their elements. This class logic is thus a generalization of [[set theory]], which allows only a limited con ==Class logic in the strict sense== ...

...theory]], [[model theory]] and [[formal language]], a '''regular numerical predicate''' is a kind of relation over integers. Regular numerical predicates can al ...{{cite book |last1=Straubing |first1=Howard |title=Finite Automata, Formal Logic and Circuit Complexity |date=1994 |publisher=Birkhäser |isbn=978-1-4612-028 ...

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 == ...

...provable. Here ''x'' cannot be a [[free variable]] of φ, while θ can be a predicate depending on it. The main application of the principle is in the study of [[intuitionistic logic]], where the principle is not generally valid. Its crucial equivalent speci ...

{{Short description|Method in mathematical logic}} In [[mathematical logic]], '''Rosser's trick''' is a method for proving a variant of [[Gödel's inco ...

...ndon School of Economics]], and [[W. V. O. Quine]].<ref>Czesław Lejewski, "Logic and Existence" ''British Journal for the Philosophy of Science''; Vol. 5 (1 == "Logic and Existence" == ...

...te. The difference to the [[axiom of choice]] is that in the [[Antecedent (logic)|antecedent]], the existence of <math>y</math> is already granted to be uni ...ive Set Theory |last1=Myhill |first1=John |journal=The Journal of Symbolic Logic |date=1975 |volume=40 |issue=3 |pages=347–382 }}</ref> or some [[Second-ord ...

...mathematical logic)|formula]] is the depth of nesting of its [[Quantifier (logic)|quantifiers]]. It plays an essential role in [[model theory]]. * We write FO[n] for the set of all [[First-order logic|first-order]] formulas φ with <math>qr(\varphi) \le n</math>. ...

...of Uppsala awarded him a doctorate in 1960). His early work was in formal logic, and he established a reputation for brilliance early in his career with a Lars Svenonius' early work was in the field of logic known as model theory, in which properties of the interpretations ("models" ...