Making Proofs Without Modus Ponens: An Introduction to the Combinatorics and Complexity of Cut Elimination

Bulletin of the American Mathematical Society - United States
doi 10.1090/s0273-0979-97-00715-5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society (AMS)

Related search

Adaptively Applying Modus Ponens in Conditional Logics of Normality

Adaptive Logics for Defeasible Reasoning
2013English

Introduction to Combinatorics

Choice Reviews Online
1997English

Generalized Modus Ponens Using Fodor’s Implication and T-Norm Product With Threshold

International Journal of Computers, Communications and Control
MathematicsComputer NetworksComputer Science ApplicationsComputational TheoryCommunications
2009English

Introduction to the PROOFS 2016 Special Section

Journal of Cryptographic Engineering
Computer NetworksSoftwareCommunications
2017English

Complexity in Automation of SOS Proofs: An Illustrative Example

2006English

Algorithmic Structuring of Cut-Free Proofs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Complexity and Healthcare: An Introduction

International Journal of Health Care Quality Assurance
AccountingManagementBusinessHealth Policy
2003English

The Complexity of Generating and Checking Proofs of Membership

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

A Note on the Complexity of Classical and Intuitionistic Proofs

2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy