Biform Theories: Project Description

04/29/2018
by   Jacques Carette, et al.
0

A biform theory is a combination of an axiomatic theory and an algorithmic theory that supports the integration of reasoning and computation. These are ideal for specifying and reasoning about algorithms that manipulate mathematical expressions. However, formalizing biform theories is challenging since it requires the means to express statements about the interplay of what these algorithms do and what their actions mean mathematically. This paper describes a project to develop a methodology for expressing, manipulating, managing, and generating mathematical knowledge as a network of biform theories. It is a subproject of MathScheme, a long-term project at McMaster University to produce a framework for integrating formal deduction and symbolic computation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/01/2023

From proof theory to theories theory

In the last decades, several objects such as grammars, economical agents...
research
04/04/2019

Towards Specifying Symbolic Computation

Many interesting and useful symbolic computation algorithms manipulate m...
research
05/25/2023

What is a Theory ?

Deduction modulo is a way to express a theory using computation rules in...
research
03/06/2013

Representing and Reasoning With Probabilistic Knowledge: A Bayesian Approach

PAGODA (Probabilistic Autonomous Goal-Directed Agent) is a model for aut...
research
03/25/2019

Designing Normative Theories of Ethical Reasoning: Formal Framework, Methodology, and Tool Support

The area of formal ethics is experiencing a shift from a unique or stand...
research
06/03/2020

Embracing undecidability: Cognitive needs and theory evaluation

There are many ways we can not know. Even in systems that we created our...
research
02/09/2022

Reflexive tactics for algebra, revisited

Computational reflection allows us to turn verified decision procedures ...

Please sign up or login with your details

Forgot password? Click here to reset