Skip to search formSkip to main contentSkip to account menu

Hilbert system

Known as: Hilbert-style deduction system, Hilbert calculus, Hilbert-style deductive systems 
In logic, especially mathematical logic, a Hilbert system, sometimes called Hilbert calculus, Hilbert-style deductive system or Hilbert–Ackermann… 
Wikipedia (opens in a new tab)

Related topics

Related topics

17 relations

Broader (1)

Automated theorem proving
Axiom of reducibilityBoolean algebraCombinatory logicFirst-order logic

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Cut elimination and strong separation for substructural logics: An algebraic approach
Highly Cited
2008
Highly Cited
2008
Comparison of envelope extraction algorithms for cardiac sound signal segmentation
Highly Cited
2005
Highly Cited
2005
GENERALIZATION OF HILBERT AND HARDY-HILBERT INTEGRAL INEQUALITIES
The main objective of this paper is a study of some new generalizations of Hilbert's and Hardy-Hilbert's type inequalities. We… 
Highly Cited
2005
Highly Cited
2005
Synthesis of very sharp Hilbert transformer using the frequency-response masking technique
Frequency translation of audio signals requires the use of very sharp Hilbert transformer if the low frequency components are to… 
2003
2003
Short Generating Functions for some Semigroup Algebras
Let a1,a2,...,an be distinct, positive integers with (a1,a2,...,an) = 1, and let k be an arbitrary field. Let H(a1,...,an;z… 
Highly Cited
2000
Highly Cited
2000
On Multidimensional Curves with Hilbert Property
Abstract. Indexing schemes for grids based on space-filling curves (e.g., Hilbert curves) find applications in numerous fields… 
Highly Cited
1995
Highly Cited
1995
Equational Propositional Logic
1992
1992
Injective Hilbert C∗-modules
One difference between Hilbert modules and Hilbert spaces is that Hilbert modules are not "self-dual" in general. Another… 
Highly Cited
1992
Highly Cited
1992
Quantifier Elimination in Second-Order Predicate Logic
An algorithm is presented which eliminates second–order quantifiers over predicate variables in formulae of type ∃P1, . . . , Pn… 
Highly Cited
1990
Highly Cited
1990
Action Logic and Pure Induction
In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become… 
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)