Skip to search formSkip to main contentSkip to account menu

Proof calculus

Known as: Calculus (disambiguation), Proof calculi, Proof system 
In mathematical logic, a proof calculus corresponds to a family of formal systems that use a common style of formal inference for its inference rules… 
Wikipedia (opens in a new tab)

Related topics

Related topics

18 relations
Calculus of structuresCirquent calculusCurry–Howard correspondenceDesign pattern

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Compositional Reasoning about Shared Futures
Distributed and concurrent object-oriented systems are difficult to analyze due to the complexity of their concurrency… 
Review
2007
Review
2007
Computers, Justification, and Mathematical Knowledge
The original proof of the four-color theorem by Appel and Haken sparked a controversy when Tymoczko used it to argue that the… 
2006
2006
Relational Approach to Order-of-Magnitude Reasoning
This work concentrates on the automated deduction of logics of order-of-magnitude reasoning. Specifically, a translation of the… 
2003
2003
Order-Based Inference in Natural Logic
This paper develops a version of Natural Logic – an inference system that works directly on natural language syntactic… 
Highly Cited
1996
Highly Cited
1996
Testing of the long code and hardness for clique
We prove that unless NP = COR, Max Clique is hard to approximate wit hin polynomial time within a factor ni /2 ‘c for any c >0… 
1996
1996
Shakespearian Modal Logic: A Labelled Treatment of Modal Identity
In this paper we describe a modal proof system arising from the combination of a tableau-like classical system, which… 
Highly Cited
1992
Highly Cited
1992
Equivalences on observable processes
  • I. Ulidowski
  • [] Proceedings of the Seventh Annual IEEE…
  • 1992
  • Corpus ID: 18165936
The finest observable and implementable equivalence on concurrent processes is sought as part of a larger program to develop a… 
1992
1992
An object-oriented refinement calculus with modular reasoning
In this thesis, the refinement calculus is extended to support a variety of object-oriented programming styles. The late binding… 
1987
1987
A Compositional Proof Theory for Real-Time Distributed Message Passing
A compositional proof system is given for an OCCAM-like real-time programming language for distributed computing with… 
1986
1986
The INFOLOG linear tense propositional logic of events and transactions
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)