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.
2009
2009
ChemAxiom – An Ontological Framework for Chemistry in Science
We present ChemAxiom as the first ontological framework for chemistry in science. ChemAxiom enables discourse about chemical… 
2008
2008
Axioms for the norm residue isomorphism
We give an axiomatic framework for proving that the norm residue map is an isomorphism (i.e., for settling the motivic Bloch-Kato… 
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… 
2000
2000
DIFFUSION MODELS AND THEIR ACCELERATED SOLUTION IN IMAGE AN D SURFACE PROCESSING
During the last decade nonlinear anisotropic diffusion models have shown to be powerful methods not only in image processing… 
2000
2000
Agent-BDI Logic
In this paper, it is demonstrated that the logic tool used in agent formalized d epiction should be the mixed modal logic which… 
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… 
1983
1983
Equivalence of the Arbiter, the Synchronizer, the Latch, and the Inertial Delay
An axiomatic method for proving correctness properties about digital circuit implementations under the influence of asynchronous… 
1980
1980
Knowledge Embedding in the Description System Omega
Omega is a description system for knowledge embedding which combines mechanisms of the predicate calculus, type systems, and… 
1973
1973
An Equational Axiomatization for the Disjoint System of Post Algebras
It is shown that the class of Post algebras of finite order n is equationally definable where the only unary operators are the… 
1969
1969
Uniformly reflexive structures: On the nature of gödelizations and relative computability
In this paper we present an axiomatic theory within which much of the theory of computability can be developed in an abstract… 
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)