Abstraction Logic: A New Foundation for (Computer) Mathematics

07/12/2022
by   Steven Obua, et al.
0

Abstraction logic is a new logic, serving as a foundation of mathematics. It combines features of both predicate logic and higher-order logic: abstraction logic can be viewed both as higher-order logic minus static types as well as predicate logic plus operators and variable binding. We argue that abstraction logic is the best foundational logic possible because it maximises both simplicity and practical expressivity. This argument is supported by the observation that abstraction logic has simpler terms and a simpler notion of proof than all other general logics. At the same time, abstraction logic can formalise both intuitionistic and classical abstraction logic, and is sound and complete for these logics and all other logics extending deduction logic with equality.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/23/2018

Faithful Semantical Embedding of a Dyadic Deontic Logic in HOL

A shallow semantical embedding of a dyadic deontic logic by Carmo and Jo...
research
07/25/2002

A Paraconsistent Higher Order Logic

Classical logic predicts that everything (thus nothing useful at all) fo...
research
09/03/2021

A Survey of the Proof-Theoretic Foundations of Logic Programming

Several formal systems, such as resolution and minimal model semantics, ...
research
05/08/2014

Dialogues for proof search

Dialogue games are a two-player semantics for a variety of logics, inclu...
research
11/24/2018

Answers to Imamura Note on the Definition of Neutrosophic Logic

In order to more accurately situate and fit the neutrosophic logic into ...
research
10/08/2019

Visual Abstraction

In this article we revisit the concept of abstraction as it is used in v...
research
11/16/2017

Mechanizing Principia Logico-Metaphysica in Functional Type Theory

Principia Logico-Metaphysica proposes a foundational logical theory for ...

Please sign up or login with your details

Forgot password? Click here to reset