Skip to search formSkip to main contentSkip to account menu

Axiomatic system

Known as: Axiomatization, Axiomatic method, Axiomatic theory 
In mathematics, an axiomatic system is any set of axioms from which some or all axioms can be used in conjunction to logically derive theorems. A… 
Wikipedia (opens in a new tab)

Related topics

Related topics

27 relations
Abstract state machinesBelief–desire–intention software modelBurrows–Abadi–Needham logicBusy beaver

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Measuring lifetime poverty
2011
2011
On Codd Families of Keys over Incomplete Relations
Keys allow a database management system to uniquely identify tuples in a database. Consequently, the class of keys is of great… 
Highly Cited
2006
Highly Cited
2006
SOME AXIOMATIZATIONS OF B-ALGEBRAS
Some systems of axioms defining a B-algebra are given with a proof of the independence of the axioms. In addition, we obtain a… 
Highly Cited
2004
Highly Cited
2004
Non-discretionary and discretionary factors and scale in data envelopment analysis
Highly Cited
1998
Highly Cited
1998
On the Relationship Between BDI Logics and Standard Logics of Concurrency
The behavior of an agent is mainly governed by the specific way in which it handles the rational balance between information and… 
Highly Cited
1996
Highly Cited
1996
Equivalences of Statecharts
We present a new semantics of Statecharts that excludes failures and a compositional formulation of this semantics based on… 
Highly Cited
1995
Highly Cited
1995
Specifying Open GIS with Functional Languages
The concept of Open GIS depends on precise definitions of data, operations and interfaces. This paper argues for the use of… 
Review
1991
Review
1991
Disunification: A Survey.
Solving an equation in an algebra of terms is known as uniication. Solving more complex formulas combining equations and… 
Highly Cited
1986
Highly Cited
1986
Expert resolution
This paper discusses some current issues in the combination of probabilities and serves as an introduction to a series of four… 
Highly Cited
1984
Highly Cited
1984
A temporal logic for reasoning about partially ordered computations (Extended Abstract)
Current Temporal Logics are all oriented towards the description of totally ordered sequences. This limits their usefulness for… 
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)