On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-36078-6_12
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Some Results on the Intermediate Logics

Publications of the Research Institute for Mathematical Sciences
Mathematics
1972English

Some Questions on External Definability

PHYSICO-MATHEMATICAL SERIES
2019English

The Effect of Explicit Strategy Instruction on L2 Oral Production of Iranian Intermediate EFL Learners: Focusing on Accuracy, Fluency and Complexity

Journal of Language Teaching and Research
2011English

Complexity of Prioritized Default Logics

Journal of Artificial Intelligence Research
Artificial Intelligence
1998English

Real-Time Logics: Complexity and Expressiveness

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
1993English

The Complexity of Lattice-Based Fuzzy Description Logics

Journal on Data Semantics
Computer NetworksInformation SystemsArtificial IntelligenceCommunications
2012English

The Complexity of Reasoning With Boolean Modal Logics

2002English

The Complexity of Model Checking for Propositional Default Logics

Data and Knowledge Engineering
Information SystemsManagement
2005English

Parallel Dialogue Games and Hypersequents for Intermediate Logics

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy