Results 11 to 20 of about 58,074 (157)
Complexity of finite-variable fragments of propositional modal logics of symmetric frames [PDF]
Logic Journal of the IGPL, 2018 While finite-variable fragments of the propositional modal logic S5--complete with respect to reflexive, symmetric and transitive frames--are polynomial-time decidable, the restriction to finite-variable formulas for logics of reflexive and transitive frames yields fragments that remain "intractable." The role of the symmetry condition in this context ...
Mikhail Rybakov, Dmitry Shkatov
openalex +5 more sources
A remark on propositional calculus with variable functors [PDF]
Proceedings of the Japan Academy, Series A, Mathematical Sciences, 1966 Yoshinari Arai, Shôtarô Tanaka
openalex +4 more sources
Text content variables as a function of comprehension: Propositional discourse analysis
Russian Journal of Linguistics, 2023 Text complexity impact on immediate recalls and range of metadiscourse markers remains a research niche due to the lack of multidisciplinary data necessary to shed light on the issue. The current study aims to identify effects of text complexity and Russian-English discourse differences on immediate text-based recalls relating to the amount and type of
Marina I. Solnyshkina +2 more
openalex +4 more sources
Algebraic formulations of propositional calculi with variable forming functors [PDF]
Proceedings of the Japan Academy, Series A, Mathematical Sciences, 1966 Kiyoshi Iséki
openalex +4 more sources
Formulas of one propositional variable in intuitionistic logic with the Solovay modality
Logic and Logical Philosophy, 2008 A description of the free cyclic algebra over the variety of Solovay algebras, as well as over its pyramid locally finite subvarieties is given.
Leo Esakia, Revaz Grigolia
openalex +4 more sources
A Complete Calculus for Possibilistic Logic Programming with Fuzzy Propositional Variables
, 2013 Appears in Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence (UAI2000)
Teresa Alsinet, Lluı́s Godo
openalex +4 more sources
Becoming Aware of Propositional Variables [PDF]
, 2011 We examine a logic that combines knowledge, awareness, and change of awareness. Change of awareness involves that an agent becomes aware of propositional variables. We show that the logic is decidable, and we present a complete axiomatization.
Hans van Ditmarsch, Tim French
openaire +1 more source
, 2013 Let \Omega be a set of unsatisfiable clauses, an implicit resolution refutation of \Omega is a circuit \beta with a resolution proof {\alpha} of the statement "\beta describes a correct tree-like resolution refutation of \Omega". We show that such system
Wang, Zi Chao
core +2 more sources
Proposition-valued random variables as information [PDF]
Synthese, 2010 The notion of a proposition as a set of possible worlds or states occupies central stage in probability theory, semantics and epistemology, where it serves as the fundamental unit both of information and meaning. But this fact should not blind us to the existence of prospects with a different structure.
openaire +2 more sources
Model-Checking Problems as a Basis for Parameterized Intractability [PDF]
, 2004 Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem). For example, Downey and Fellow's W-hierarchy is of this form.
Downey +3 more
core +2 more sources