Interactive Theorem Proving and finite projective planes

Author(s):  
Johannes Ueberberg
2011 ◽  
Vol 21 (4) ◽  
pp. 671-677 ◽  
Author(s):  
GÉRARD HUET

This special issue of Mathematical Structures in Computer Science is devoted to the theme of ‘Interactive theorem proving and the formalisation of mathematics’.The formalisation of mathematics started at the turn of the 20th century when mathematical logic emerged from the work of Frege and his contemporaries with the invention of the formal notation for mathematical statements called predicate calculus. This notation allowed the formulation of abstract general statements over possibly infinite domains in a uniform way, and thus went well beyond propositional calculus, which goes back to Aristotle and only allowed tautologies over unquantified statements.


1977 ◽  
Vol 19 (1) ◽  
pp. 67-76 ◽  
Author(s):  
D. McCarthy ◽  
S.A. Vanstone

CAUCHY ◽  
2016 ◽  
Vol 4 (3) ◽  
pp. 131
Author(s):  
Vira Hari Krisnawati ◽  
Corina Karim

<p class="abstract"><span lang="IN">In combinatorial mathematics, a Steiner system is a type of block design. Specifically, a Steiner system <em>S</em>(<em>t</em>, <em>k</em>, <em>v</em>) is a set of <em>v</em> points and <em>k</em> blocks which satisfy that every <em>t</em>-subset of <em>v</em>-set of points appear in the unique block. It is well-known that a finite projective plane is one examples of Steiner system with <em>t</em> = 2, which consists of a set of points and lines together with an incidence relation between them and order 2 is the smallest order.</span></p><p class="abstract"><span lang="IN">In this paper, we observe some properties from construction of finite projective planes of order 2 and 3. Also, we analyse the intersection between two projective planes by using some characteristics of the construction and orbit of projective planes over some representative cosets from automorphism group in the appropriate symmetric group.</span></p>


2021 ◽  
Author(s):  
Steven Obua

This is a first sketch of the design of Practal, an interactive theorem proving system for practical logic.


Sign in / Sign up

Export Citation Format

Share Document