Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • {{Short description|Commonly used rules of replacement in propositional logic}} {{About|the rule of inference|the formula of absolute truth|Tautology (logic)|other uses|Tautology (disambiguation)}} ...
    3 KB (405 words) - 00:08, 21 June 2024
  • | field = [[Propositional calculus]] ...n because the term <math>Q</math> is "absorbed" by the term <math>P</math> in the [[consequent]].<ref>Whitehead and Russell, ''[[Principia Mathematica]]' ...
    3 KB (521 words) - 13:21, 12 February 2025
  • In [[mathematical logic]] and [[metalogic]], a [[formal system]] is called '''complete''' with resp ...al [[Validity (logic)|validity]]. Intuitively, a system is called complete in this particular sense, if it can derive every formula that is true. ...
    7 KB (953 words) - 19:19, 10 January 2025
  • {{Short description|Rule of replacement in propositional logic}} | field = [[Propositional calculus]] ...
    5 KB (754 words) - 17:52, 1 February 2024
  • {{Short description|Principle of classical logic}} ...port-export''' is a name given to the propositional form of [[Exportation (logic)|Exportation]]: ...
    4 KB (588 words) - 20:21, 31 December 2023
  • {{Short description|Axiom used in logic and philosophy}} ...l logic]]. It can be thought of as the [[law of excluded middle]] written in a form that involves only one sort of connective, namely implication. ...
    10 KB (1,512 words) - 18:14, 3 February 2025
  • ...y in logic.<ref name=":0" /> The duality consists in these [[metalogic]]al theorems: ...ogic)|conjunction]] and [[Logical disjunction|disjunction]] can be defined in terms of each other, and consequently, only one of them needs to be taken a ...
    9 KB (1,391 words) - 20:57, 25 October 2024
  • ...The characterization of standard complexity classes and correspondence to propositional proof systems allows to interpret theories of bounded arithmetic as formal ...Feasibility in Arithmetic, Jour. Symbolic Logic 36 (1971) 494–508.</ref> in 1971, and later developed by [[Samuel Buss|Samuel R. Buss]]. <ref name="bus ...
    11 KB (1,582 words) - 09:00, 6 January 2025
  • ...nguish|text=the [[Gödel Prize]]}}{{Short description|Award in mathematical logic}} ...c|url=https://www.jstor.org/stable/2275205|journal=The Journal of Symbolic Logic|volume=57|issue=1|pages=352–365|doi=10.2307/2275205|issn=0022-4812|quote=Da ...
    5 KB (689 words) - 21:49, 17 February 2025
  • {{Short description|Symbolic logic system}} ...37}} It is an [[Intuitionistic logic|intuitionistic]] and [[paraconsistent logic]], that rejects both the [[law of the excluded middle]] as well as the [[pr ...
    23 KB (3,653 words) - 21:38, 20 November 2024
  • {{Short description|Extension of modal logic}} {{For|the subject in digital electronics also known as clocked logic|dynamic logic (digital electronics)}} ...
    29 KB (4,805 words) - 07:24, 18 February 2025
  • ...stian cleric in red argues towards an older pensive white Christian cleric in black.]] ...britannica.com/topic/reductio-ad-absurdum|title=Reductio ad absurdum {{!}} logic|website=Encyclopedia Britannica|language=en|access-date=2019-11-27}}</ref>< ...
    12 KB (1,632 words) - 19:07, 26 February 2025
  • ...Laws</ref> or between formulas themselves, for instance, in [[mathematical logic]]. For example, the formula <math>a^2 \geq 0</math> is true for all [[real with equality only in the degenerate case of a triangle with zero [[area]]. In [[Euclidean geometry]] and some other geometries, the triangle inequality i ...
    14 KB (2,142 words) - 21:15, 8 December 2024
  • ...an output signal based on a threshold function. By connecting these units in various configurations, McCulloch and Pitts demonstrated that their model c ...ical theory of automata]''. In L. A. Jeffress (Ed.), ''Cerebral mechanisms in behavior; the Hixon Symposium'' (pp. 1–41). Wiley.</ref> ...
    19 KB (2,799 words) - 22:58, 10 January 2025
  • ...the original DEL framework; more details about DEL in general can be found in the references. ...pistemology]]), [[economics]] ([[game theory]]) and [[cognitive science]]. In computer science, DEL is for example very much related to [[multi-agent sys ...
    53 KB (8,791 words) - 22:52, 27 November 2023
  • ...ean algebra is therefore a formal way of describing [[logical operation]]s in the same way that elementary algebra describes numerical operations. ...d is provided for in all modern [[programming language]]s. It is also used in [[set theory]] and [[statistics]].<ref name="Givant-Halmos_2009"/> ...
    74 KB (11,051 words) - 05:32, 16 January 2025
  • {{short description|Study of the scope and nature of logic}} {{Distinguish|Philosophical logic}} ...
    97 KB (14,336 words) - 10:56, 19 February 2025
  • In [[order theory]] and [[model theory]], branches of mathematics, '''Cantor's ..., Cantor's original proof only used the "going forth" half of this method. In terms of [[model theory]], the isomorphism theorem can be expressed by sayi ...
    25 KB (3,609 words) - 21:53, 28 July 2024
  • ...dered in antiquity, but some precursors of the concept can perhaps be seen in the work of medieval philosophers and mathematicians such as [[Oresme]]. ...nalysis]] by [[Weierstrass]] and others, the reformulation of [[geometry]] in terms of analysis, and the invention of [[set theory]] by [[Georg Cantor|Ca ...
    78 KB (11,625 words) - 16:51, 28 February 2025
  • {{Short description|Notable events in the history of geometry}} ...he other [[Vedic civilization|Vedic]] "[[Sulba Sutras]]" ("rule of chords" in [[Sanskrit]]) use [[Pythagorean triples]], contain a number of geometrical ...
    12 KB (1,511 words) - 10:15, 8 February 2025
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)