Amanote Research

Amanote Research

  • Register
  • Sign In

Towards a Proof Theory of Gödel Modal Logics

Logical Methods in Computer Science- Germany

doi 10.2168/lmcs-7(2:10)2011

Full Text

Abstract

Available in

Categories

Computer ScienceTheoretical Computer Science

Date

May 17, 2011

Authors

George MetcalfeNicola Olivetti

Publisher

Logical Methods in Computer Science e.V.


Related search

A Finite Model Property for Gödel Modal Logics

Swedish

Labelled Propositional Modal Logics: Theory and Practice

Journal of Logic and Computation
ArtsHumanitiesHardwareArchitectureLogicTheoretical Computer ScienceSoftware
1997English

Fuzzy Description Logics Under Gödel Semantics

International Journal of Approximate Reasoning
Applied MathematicsTheoretical Computer ScienceArtificial IntelligenceSoftware
2009Swedish

Monadic Fragments of Gödel Logics: Decidability and Undecidability Results

English

SAT in Monadic Gödel Logics: A Borderline Between Decidability and Undecidability

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Modal Logics of Reactive Frames

Cognitive Technologies
2013English

Semantical Proof of Subformula Property for the Modal Logics K 4.3, KD 4.3, and S4.3

Bulletin of the Section of Logic
PhilosophyLogic
2019English

Translating Classical Probability Logics Into Modal Fuzzy Logics

2019English

Two-Layer Modal Logics: From Fuzzy Logics to a General Framework

English

Amanote Research

Note-taking for researchers

Follow Amanote


© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy