REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION (Q5009679): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
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.1017/bsl.2021.17 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3159106070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial ring calculus for modalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axioms for abstract model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3408862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The classical decision problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paraconsistent logic: consistency, contradiction and negation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and synthesis of logics. How to cut and paste reasoning systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2757760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Decision Problem for Two-Variable First-Order Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of computability theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5650662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5799431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General recursive functions of natural numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of independently axiomatizable bimodal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On languages with two variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admissibility of logical inference rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4914978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronization of logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On meet-combination of logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5226947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modulated fibring and the collapsing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibring: completeness preservation / rank
 
Normal rank

Revision as of 08:06, 26 July 2024

scientific article; zbMATH DE number 7379167
Language Label Description Also known as
English
REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION
scientific article; zbMATH DE number 7379167

    Statements

    REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION (English)
    0 references
    5 August 2021
    0 references
    meet-combination of logics
    0 references
    reduction
    0 references
    decidability
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references