<--- Back to Details
First PageDocument Content
Logical syntax / Formal languages / Formal systems / Mathematical proofs / Theorem / Well-formed formula / If and only if / Formal proof / Function / Logic / Mathematics / Mathematical logic
Date: 2006-04-17 16:54:45
Logical syntax
Formal languages
Formal systems
Mathematical proofs
Theorem
Well-formed formula
If and only if
Formal proof
Function
Logic
Mathematics
Mathematical logic

Add to Reading List

Source URL: www.math.washington.edu

Download Document from Source Website

File Size: 39,07 KB

Share Document on Facebook

Similar Documents

Truth in Mathematics: The Question of Pluralism∗ Peter Koellner “. . . before us lies the boundless ocean of unlimited possibilities.” —Carnap, The Logical Syntax of Language

DocID: 1uNva - View Document

REDO Redesigning Logical Syntax Action de Recherche Collaborative 2009 INRIA Saclay - Île-de-France

DocID: 1tNl7 - View Document

REDO — Redesigning Logical Syntax • What is it about ? Proofs are everywhere! — We are trying to improve them. • What is the problem ? Remove bureaucracy but keep the computational content.

DocID: 1tC3X - View Document

Logic / Theoretical computer science / Logic in computer science / Mathematics / Lambda calculus / Formal languages / Mathematical logic / Syntax / Combinatory logic / FO / Well-formed formula / Logic programming

Expressive Logical Combinators for Free Pierre Genevès (CNRS) Joint work with Alan Schmitt (Inria) IJCAI, July 30th 2015, Buenos Aires

DocID: 1qN5j - View Document

Logic / Computing / Mathematics / Automated theorem proving / Proof theory / Type theory / Logical truth / Syntax / Matita / Proof assistant / Mathematical proof / CurryHoward correspondence

Crafting a Proof Assistant Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, and Stefano Zacchiroli Department of Computer Science, University of Bologna Mura Anteo Zamboni, 7 – 40127 Bologna, ITALY {asperti,sacerd

DocID: 1qygU - View Document