<--- Back to Details
First PageDocument Content
Academia / George Peacock / Cambridge Mathematical Tripos / Alexander Macfarlane / Arthur Cayley / Analytical Society / Calculus / Isaac Todhunter / Quaternion / Fellows of the Royal Society / Mathematics / British people
Date: 2003-11-02 15:20:20
Academia
George Peacock
Cambridge Mathematical Tripos
Alexander Macfarlane
Arthur Cayley
Analytical Society
Calculus
Isaac Todhunter
Quaternion
Fellows of the Royal Society
Mathematics
British people

Add to Reading List

Source URL: library.beau.org

Download Document from Source Website

File Size: 554,61 KB

Share Document on Facebook

Similar Documents

Logic / Mathematics / Automated theorem proving / Logic programming / Mathematical logic / Logical truth / Propositional calculus / Substitution / Sequence / LOOP / Constructible universe / Ground expression

Extending the Calculus of Looping Sequences to Model Protein Interaction at the Domain Level Roberto Barbuti, Andrea Maggiolo–Schettini, and Paolo Milazzo Dipartimento di Informatica, Universit` a di Pisa

DocID: 1xVZ1 - View Document

Biology / Biochemistry / Logic in computer science / Molecular biology / Epidermal growth factor / Morphogens / Protein domain / Rewriting / Natural computing / RNA polymerase / RNA

The Calculus of Looping Sequences Roberto Barbuti, Giulio Caravagna, Andrea Maggiolo–Schettini, Paolo Milazzo, and Giovanni Pardini Dipartimento di Informatica, Universit` a di Pisa Largo B. Pontecorvo 3, 56127 Pisa, I

DocID: 1xVKh - View Document

Theoretical computer science / Mathematics / Computational complexity theory / Logic in computer science / Automated theorem proving / NP-complete problems / Electronic design automation / Formal methods / Conflict-driven clause learning / Boolean satisfiability problem / Clause / Unit propagation

A Model-Constructing Satisfiability Calculus Leonardo de Moura1 and Dejan Jovanovi´c2 1 2 Microsoft Research

DocID: 1xVCc - View Document

Proof theory / Mathematical logic / Logic / Mathematics / Sequent / Natural deduction / Cut-elimination theorem / Admissible rule / Proof complexity / Propositional calculus / Structural rule / Cut rule

Under consideration for publication in Math. Struct. in Comp. Science Complexity of Translations from Resolution to Sequent Calculus (Presentation-Only - Draft) Giselle Reis1 and Bruno Woltzenlogel Paleo2

DocID: 1xVA3 - View Document

Theoretical computer science / Computational complexity theory / Mathematics / Logic in computer science / Constraint programming / Electronic design automation / Formal methods / NP-complete problems / Boolean satisfiability problem / Conflict-driven clause learning / Satisfiability modulo theories / Unit propagation

The Design and Implementation of the Model Constructing Satisfiability Calculus Dejan Jovanovi´c Clark Barrett

DocID: 1xV9I - View Document