On the structure of Valiant's complexity class.
Bürgisser, Peter (1999)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Displaying similar documents to “Unsolvable systems of equations and proof complexity.”
On the structure of Valiant's complexity class.
On two notions of complexity of algebraic numbers
Yann Bugeaud, Jan-Hendrik Evertse (2008)
Acta Arithmetica
Similarity:
Algebraic Approach to Algorithmic Logic
Grzegorz Bancerek (2014)
Formalized Mathematics
Similarity:
We introduce algorithmic logic - an algebraic approach according to [25]. It is done in three stages: propositional calculus, quantifier calculus with equality, and finally proper algorithmic logic. For each stage appropriate signature and theory are defined. Propositional calculus and quantifier calculus with equality are explored according to [24]. A language is introduced with language signature including free variables, substitution, and equality. Algorithmic logic requires a bialgebra...
Topologically compact structures and positive formulas
L. Pacholski, B. Węglorz (1968)
Colloquium Mathematicae
Similarity:
Variable Sharing in Substructural Logics: an Algebraic Characterization
Guillermo Badia (2018)
Bulletin of the Section of Logic
Similarity:
We characterize the non-trivial substructural logics having the variable sharing property as well as its strong version. To this end, we find the algebraic counterparts over varieties of these logical properties.
On an algebraic and Kripke semantics for intermediate logics
Hiroakira Ono, Cecylia Rauszer (1982)
Banach Center Publications
Similarity:
The Leibniz rule in algebraic -theory.
Smirnov, A.L. (2004)
Zapiski Nauchnykh Seminarov POMI
Similarity:
A purely algebraic proof of special cases of Tchebotarev's theorem
J. Wójcik (1975)
Acta Arithmetica
Similarity:
Basic Theorems On Turing Algorithms
Vladeta Vučković (1961)
Publications de l'Institut Mathématique
Similarity:
Concerning some theorems of Marczewski on algebraic independence
J. Schmidt (1964)
Colloquium Mathematicae
Similarity:
Some algebraic aspects of tournament theory
J. C. Varlet (1975)
Colloquium Mathematicae
Similarity:
On some structures defined by algebraic equations
U. C. Vohra, K. D. Singh (1973)
Annales Polonici Mathematici
Similarity:
Involutive Nonassociative Lambek Calculus: Sequent Systems and Complexity
Wojciech Buszkowski (2017)
Bulletin of the Section of Logic
Similarity:
In [5] we study Nonassociative Lambek Calculus (NL) augmented with De Morgan negation, satisfying the double negation and contraposition laws. This logic, introduced by de Grooté and Lamarche [10], is called Classical Non-Associative Lambek Calculus (CNL). Here we study a weaker logic InNL, i.e. NL with two involutive negations. We present a one-sided sequent system for InNL, admitting cut elimination. We also prove that InNL is PTIME.
Pre-adjunctions and lambda-algebraic theories
Antoni Wiweger (1984)
Colloquium Mathematicae
Similarity: