enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Stanhope Demonstrator - Wikipedia

    en.wikipedia.org/wiki/Stanhope_Demonstrator

    The Stanhope Demonstrator was the first machine to solve problems in logic. [1] It was designed by Charles Stanhope, 3rd Earl Stanhope to demonstrate consequences in logic symbolically. The first model was constructed in 1775. It consisted of two slides coloured red and gray mounted in a square brass frame.

  3. To Mock a Mockingbird - Wikipedia

    en.wikipedia.org/wiki/To_Mock_a_Mockingbird

    To Mock a Mockingbird and Other Logic Puzzles: Including an Amazing Adventure in Combinatory Logic (1985, ISBN 0-19-280142-2) is a book by the mathematician and logician Raymond Smullyan. It contains many nontrivial recreational puzzles of the sort for which Smullyan is well known.

  4. Automated reasoning - Wikipedia

    en.wikipedia.org/wiki/Automated_reasoning

    Automated reasoning programs are being applied to solve a growing number of problems in formal logic, mathematics and computer science, logic programming, software and hardware verification, circuit design, and many others. The TPTP (Sutcliffe and Suttner 1998) is a library of such problems that is updated on a regular basis.

  5. Logical spreadsheet - Wikipedia

    en.wikipedia.org/wiki/Logical_spreadsheet

    A logical spreadsheet is a spreadsheet in which formulas take the form of logical constraints rather than function definitions.. In traditional spreadsheet systems, such as Excel, cells are partitioned into "directly specified" cells and "computed" cells and the formulas used to specify the values of computed cells are "functional", i.e. for every combination of values of the directly ...

  6. Socratic questioning - Wikipedia

    en.wikipedia.org/wiki/Socratic_questioning

    Socratic questioning (or Socratic maieutics) [1] is an educational method named after Socrates that focuses on discovering answers by asking questions of students. According to Plato, Socrates believed that "the disciplined practice of thoughtful questioning enables the scholar/student to examine ideas and be able to determine the validity of those ideas". [2]

  7. Hoare logic - Wikipedia

    en.wikipedia.org/wiki/Hoare_logic

    Hoare logic (also known as Floyd–Hoare logic or Hoare rules) is a formal system with a set of logical rules for reasoning rigorously about the correctness of computer programs. It was proposed in 1969 by the British computer scientist and logician Tony Hoare , and subsequently refined by Hoare and other researchers. [ 1 ]

  8. Outline of logic - Wikipedia

    en.wikipedia.org/wiki/Outline_of_logic

    Logic is the formal science of using reason and is considered a branch of both philosophy and mathematics and to a lesser extent computer science. Logic investigates and classifies the structure of statements and arguments, both through the study of formal systems of inference and the study of arguments in natural language .

  9. Principles of Mathematical Logic - Wikipedia

    en.wikipedia.org/wiki/Principles_of_Mathematical...

    FOL is now a core formalism of mathematical logic, and is presupposed by contemporary treatments of Peano arithmetic and nearly all treatments of axiomatic set theory. The 1928 edition included a clear statement of the Entscheidungsproblem ( decision problem ) for FOL, and also asked whether that logic was complete (i.e., whether all semantic ...