Search results

{{Short description|Software for solving satisfiability problems}} {{Infobox software ...

...l Society|date=November 2007|access-date=11 June 2013}}</ref> Open-source software in mathematics has become pivotal in education because of the high cost of == Computer algebra systems== ...

| influenced_by = [[ML (programming language)|ML]]<br>[[Coq (software)|Coq]]<br>[[Haskell]] ...rst=André |editor2-last=Sutcliffe |editor2-first=Geoff |chapter=The Lean 4 Theorem Prover and Programming Language |title=Automated Deduction – CADE 28 |serie ...

Software has been developed to automate the task of proving Shannon-type inequalities.<ref>{{cite web |first1=R.W. |last1=Yeung |first2 Given an inequality, such software is able to determine whether the given inequality is a valid Shannon-type i ...

...hecking and the State Explosion Problem |conference=LASER Summer School on Software Engineering: LASER 2011 |year=2011 |pages=1–30 |series=Lecture Notes in Com ...cation of Finite State Systems |book-title=Logics and Models of Concurrent Systems |series=NATO ASI |volume=13 |doi=10.1007/978-3-642-82453-1_1 |doi-access=fr ...

...lutions can easily be checked by substitution, but more work is needed for proving that there are no other solutions. ...of the solutions (in the case of a single equation, this is [[Abel–Ruffini theorem]]). ...

| title = Specifying Concurrent Systems with TLA⁺ | series = NATO Science Series, III: Computer and Systems Sciences ...

{{For|solving systems of inequalities|Dis-unification}} ...ce|first1=Hubert|last1=Comon|title=Sufficient Completeness, Term Rewriting Systems and 'Anti-Unification'|book-title=Proc. 8th International Conference on Aut ...

{{Type systems}} ...ture |last1=Pollack |first1=Robert |publisher=Springer |book-title=Theorem Proving in Higher Order Logics, 13th International Conference |pages=462–479 |confe ...

...pe theory and factorization systems: one by Richard Garner, "Factorisation systems for type theory",<ref>[http://comp.mq.edu.au/~rgarner/Papers/Uppsala.pdf Ri ...icant amounts of "synthetic homotopy theory" in the proof assistant [[Coq (software)|Coq]]; this formed the basis of the library later called "Foundations" and ...

...inequalities ([[halfspace]]s), and the [[Krein–Milman theorem|Minkowski's theorem]] on [[extreme point]]s -->.<ref name="KT91" >{{harvtxt|Klafszky|Terlaky|19 ...ntarity problems with sufficient matrices|journal=Optimization Methods and Software|volume=21|year=2006|number=2|pages=247–266|doi=10.1080/10556780500095009|ur ...

...n Embedded Software Primer |date=1999 |page=253 |quote="For hard real-time systems, therefore, it is important to write subroutines that always execute in the ...these are languages that guarantee all subroutines finish, such as [[Coq (software)|Coq]].{{cn|date=May 2017}} ...

...eory]] and in Quine's axiomatic set theory [[New Foundations]] and related systems (where it affords a rather surprising alternative solution to the [[Burali- .... Hence, they are [[discrete set]]s, so they are countable. Proof of first theorem: If {{math|1=''P''^(''α'') = ∅}} for some index ''α'', then ''{{p ...

...n#Bosonic codes|Gottesman–Kitaev–Preskill codes]]<br />[[Quantum threshold theorem]]<br />[[QIP (complexity)|QIP]]<br />[[QMA]] ...itor2-last=Mahajan |editor2-first=Meena |title=FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science |chapter-url=https://link.sprin ...

...of logic as the discipline investigating the properties of formal logical systems, like [[consistency]] and [[Completeness (logic)|completeness]]. ...logical [[formal system]]s and on how they differ from non-logical formal systems. Important considerations in this respect are whether the formal system in ...

* Agency: These tasks are for a language-model–based [[software agent]] that operates a computer for a user, such as editing images, browsi ...he questions that can be asked. For example, with mathematical questions, "proving a claim" would be difficult to automatically check, while "calculate an ans ...

...welfare economics#Proof of the first fundamental theorem|first fundamental theorem of welfare economics]].<ref>Blaug (2007), p. 185, 187</ref> These models l ...n|tâtonnement]]) drives the fundamental premise of mathematical economics: systems of economic actors may be modeled and their behavior described much like an ...

;[[Bohr–van Leeuwen theorem]] ...um mechanical]] effect, a result now referred to as the [[Bohr–van Leeuwen theorem]]. ([[Niels Bohr]] had arrived at the same conclusion a few years earlier.) ...

...>\zeta(1)=\log\infty</math>, and he makes use of this latter result in his Theorem 19, to show that the sum of the inverses of the prime numbers is <math>\log ...this analytic continuation will lead to the same result, by the [[identity theorem]]. A first step in this continuation observes that the series for the zeta ...

{{term |1=[[Bayes' theorem]]}} {{defn |1=A theorem in probability theory used to update the probability for a hypothesis as mo ...