Computational logic: its origins and applications
From MaRDI portal
Publication:4559535
History of mathematics in the 20th century (01A60) History of computer science (68-03) Specification and verification (program logics, model checking, etc.) (68Q60) History of mathematics in the 21st century (01A61) Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70)
Abstract: Computational Logic is the use of computers to establish facts in a logical formalism. Originating in 19th-century attempts to understand the nature of mathematical reasoning, the subject now comprises a wide variety of formalisms, techniques and technologies. One strand of work follows the "LCF approach" pioneered by Robin Milner FRS, where proofs can be constructed interactively or with the help of users' code (which does not compromise correctness). A refinement of LCF, called Isabelle, retains these advantages while providing flexibility in the choice of logical formalism and much stronger automation. The main application of these techniques has been to prove the correctness of hardware and software systems, but increasingly researchers have been applying them to mathematics itself.
Recommendations
Cites work
- scientific article; zbMATH DE number 1646230 (Why is no real title available?)
- scientific article; zbMATH DE number 3873291 (Why is no real title available?)
- scientific article; zbMATH DE number 3991418 (Why is no real title available?)
- scientific article; zbMATH DE number 3735770 (Why is no real title available?)
- scientific article; zbMATH DE number 3521895 (Why is no real title available?)
- scientific article; zbMATH DE number 3521950 (Why is no real title available?)
- scientific article; zbMATH DE number 3548474 (Why is no real title available?)
- scientific article; zbMATH DE number 1543300 (Why is no real title available?)
- scientific article; zbMATH DE number 1550337 (Why is no real title available?)
- scientific article; zbMATH DE number 1550344 (Why is no real title available?)
- scientific article; zbMATH DE number 1550345 (Why is no real title available?)
- scientific article; zbMATH DE number 7015112 (Why is no real title available?)
- scientific article; zbMATH DE number 234014 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A Machine-Oriented Logic Based on the Resolution Principle
- A formally verified proof of the central limit theorem
- A framework for defining logics
- A machine-assisted proof of Gödel's incompleteness theorems for the theory of hereditarily finite sets
- A machine-checked proof of the odd order theorem
- A revision of the proof of the Kepler conjecture
- A term of length 4 523 659 424 929
- CakeML
- Commutative algebra in the Mizar system
- Constructive mathematics and computer programming
- Coquelicot: a user-friendly library of real analysis for Coq
- Edinburgh LCF. A mechanized logic of computation
- Flyspeck I: Tame Graphs
- Formal certification of a compiler back-end or: programming a compiler with a proof assistant
- Formal verification of a floating-point expansion renormalization algorithm
- Formalizing an analytic proof of the prime number theorem
- Homotopy type theory. Univalent foundations of mathematics
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Logic in Computer Science
- Markov chains and Markov decision processes in Isabelle/HOL
- Mechanizing set theory. Cardinal arithmetic and the axiom of choice
- Natural deduction as higher-order resolution
- Nitpick: a counterexample generator for higher-order logic based on a relational model finder
- Proof assistants: history, ideas and future
- Set theory. An introduction to independence proofs
- Software model checking
- Solution of the Robbins problem
- Tactics for mechanized reasoning: a commentary on Milner (1984) ‘The use of machines to assist in rigorous proof’
- The Four Colour Theorem: Engineering of a Formal Proof
- The Jordan Curve Theorem, Formally and Informally
- The Relative Consistency of the Axiom of Choice Mechanized Using Isabelle⁄zf
- The calculus of constructions
- The foundation of a generic theorem prover
- Verification of the Miller-Rabin probabilistic primality test.
Cited in
(17)- Computer Science Logic
- Formalising basic topology for computational logic in simple type theory
- scientific article; zbMATH DE number 2000436 (Why is no real title available?)
- From LCF to Isabelle/HOL
- scientific article; zbMATH DE number 1342354 (Why is no real title available?)
- Formalising mathematics -- in praxis; a mathematician's first experiences with Isabelle/HOL and the why and how of getting started
- Formalising Mathematics in Simple Type Theory
- Logics, mathematics, automatic deduction
- On the unusual effectiveness of logic in computer science
- scientific article; zbMATH DE number 6934359 (Why is no real title available?)
- scientific article; zbMATH DE number 1696784 (Why is no real title available?)
- Computational Logic and Continuous Mathematics, Pure and Applied
- A modular first formalisation of combinatorial design theory
- Connecting logical representations and efficient computations
- Reasoning, Logic and Computation
- scientific article; zbMATH DE number 1926652 (Why is no real title available?)
- Logic and Computation
Describes a project that uses
Uses Software
This page was built for publication: Computational logic: its origins and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4559535)