Undecidability of the problem of recognizing axiomatizations of superintuitionistic propositional calculi (Q2259003): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1347607
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Evgeni E. Zolin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11225-013-9520-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009544487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results regarding the axiomatization of partial propositional calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4866422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the disjunction property of propositional logics and other related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An undecidable problem in correspondence theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3247126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A detailed argument for the Post-Linial theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Ways of Constructing a Propositional Calculus of Any Required Degree of Unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3247123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Relativization Procedure for Propositional Calculi, with an Application to a Generalized Form of Post's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Post-Lineal theorems for arbitrary recursively enumerable degree of unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of the general problems of completeness, decidability and equivalence for propositional calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5783647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pretabular superintuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Craig's theorem in superintuitionistic logics and amalgamable varieties of pseudo-Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5822052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Reductions of the General Combinatorial Decision Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complex of problems proposed by Post / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on finite axiomatization of partial propositional calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tag systems and lag systems / rank
 
Normal rank

Latest revision as of 17:55, 9 July 2024

scientific article
Language Label Description Also known as
English
Undecidability of the problem of recognizing axiomatizations of superintuitionistic propositional calculi
scientific article

    Statements

    Undecidability of the problem of recognizing axiomatizations of superintuitionistic propositional calculi (English)
    0 references
    27 February 2015
    0 references
    classical propositional logic
    0 references
    intuitionistic propositional logic
    0 references
    superintuitionistic calculus
    0 references
    implicational calculus
    0 references
    finite axiomatization
    0 references
    tag system
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers