Search results

...s;<ref name="Ono">Ono (2003).</ref> it extends the logic [[Monoidal t-norm logic|MTL]] of all left-continuous t-norms. The language of the propositional logic BL consists of [[countable|countably]] many [[propositional variable]]s and ...

{{short description|Mathematical logic theory with exactly one countably infinite model up to isomorphism}} ...-categorical'''. The notion is most important for countable [[first-order logic|first-order]] theories. ...

...cuted within its ''environment''. This knowledge is usually represented in logic-based [[action description language]] and used as the input for [[automated ...[[computational logic]]. As an example of a method based on propositional logic, we can mention SLAF (Simultaneous Learning and Filtering) algorithm,<ref n ...

...ar 1964.<ref>{{cite journal|last1=George Bosworth Burch|title=Seven-Valued Logic in Jain Philosophy|journal=International Philosophical Quarterly|date=Febru ...and the Philosophical Basis of Pluralism|journal=History and Philosophy of Logic|date=2002|volume=23|issue=4 |pages=267–281|url=https://www.academia.edu/214 ...

...bles range over only one type; hence the underlying logic is [[first-order logic]]. '''ST''' is "simple" (relative to the type theory of ''[[Principia Mathe Let <math>\Phi(x)</math> denote any [[first-order logic|first-order formula]] containing the [[free variable]] <math>x</math>. ...

...tegory-theoretic analog to the logical concept of a [[Theory (mathematical logic)|theory]] and its [[Model theory|models]]. They allow multisorted models an ...equivalent definition. There are still other definitions in the research literature. ...

...inite_and_infinite|infinite sequences]] defined via finite [[Decidability_(logic)|decidable]] properties. Here a ''species'' is a collection, a notion simil ...are defined via a '''spread function''', which performs a ([[Decidability_(logic)|decidable]]) "check" on finite sequences. If all the ''finite initial part ...

...bedded dependency (ED) is a [[Sentence (logic)|sentence]] in [[first-order logic]] of the form: ...uality atom has the form <math>w_i = w_j</math>, where each of the [[Term (logic)|terms]] <math>w, ..., w_h, w_i, w_j</math> are [[Variable (mathematics)|va ...

In [[computer science]] and [[mathematical logic]], an '''infinite-tree automaton''' is a [[state machine]] that deals with ...logical theories are closely connected and it allows decision problems in logic to be reduced into decision problems for automata. ...

...d by [[automatic reasoning]], regardless of the specific [[Interpretation (logic)|interpretation]]. In literature, the set of certain answers is usually defined as follows:<ref name="Libkin ...

...l automaton]], [[timed propositional temporal logic]] and [[clock temporal logic]]. They are also used in programs such as [[UPPAAL]] which implement timed ...ed a clock. Intuitively, a clock is similar to a variable in [[first-order logic]], it is an element which may be used in a logical formula and which may ta ...

...ps://books.google.com/books?id=bGR9AwAAQBAJ&pg=PA59 |chapter = Grammar and Logic |title = Judgement and Reasoning in the Child |series= International Librar ...m is the all-round understanding which makes the sentence into a whole. In logic juxtaposition leads to an absence of implication and reciprocal justificati ...

...subset of the limiting support of ''P_n''. By the aforementioned logic, this statement is also false. ==Additional literature== ...

...cidable]]. The class of all real closed valuation rings is [[Decidability (logic)|decidable]] (by Cherlin-Dickmann) and the class of all real closed fields ...f commutative rings, all these properties can be (and are) analyzed in the literature. They all lead to different classes of rings which are unfortunately also c ...

...gi|Walker|2003|p=511}}}} and '''Berarducci trees'''<ref>{{cite book |title=Logic and algebra |date=1996 |publisher=Marcel Dekker |location=New York |isbn=08 ...strom |first2=Vincent |last3=de Vries |first3=Fer-Jan |title=Algebraic and Logic Programming |chapter=Meaningless terms in rewriting |series=Lecture Notes i ...

...cal [[probability theory]], such as [[Bayes' theorem]], and of [[inductive logic]].<ref name="veritas">{{cite web |url=https://www.youtube.com/watch?v=gj40s ...'[[Is There a God?]]'', omitting the use of Bayes' theorem and [[inductive logic]], but including a discussion of [[many-worlds interpretation|multiple univ ...

...could be introduced here. (It's a useful distinction and grounded in the literature, but it's not universal and annoying to have to follow it consistently).--> ...rent kinds (handbook articles, atheoretical grammars/dictionaries, primary literature) but I'm sure that could go further. -Botterweg14 --> Rhetorical questions ...

| subjects = [[Foundations of mathematics]], [[Symbolic logic]] ...paradox|his famous paradox]] and argued his thesis that mathematics and [[logic]] are identical.<ref name="Principles 1"/> ...

...the feature model permits. The most common approach is to use mathematical logic to capture the semantics of a feature diagram.<ref name="Schobbens">Schobbe ...veral feature models (e.g. to check whether a model is a [[Specialization (logic)|specialization]] or [[Code refactoring|refactoring]] or [[generalization]] ...

In [[mathematical logic]] and [[theoretical computer science]], an '''abstract rewriting system''' ...equivalences, a fair bit of variation in definitions is encountered in the literature. For instance, in Terese the Church–Rosser property and confluence are defi ...