Some connections between presentability of complexity classes and the power of formal systems of reasoning

2006 ◽  
pp. 364-369 ◽  
Author(s):  
Wojciech Kowalczyk
Keyword(s):  
Complexity Classes ◽  
Formal Systems

Modality and folk psychology

2019 ◽  
Vol 28 (1) ◽  
pp. 19-27
Author(s):  
Ja. O. Petik
Keyword(s):  
Modal Logic ◽  
Brain Activity ◽  
Formal System ◽  
Philosophy Of Logic ◽  
Psychological States ◽  
Formal Systems ◽  
Modern Psychology ◽  
Philosophical Interpretation ◽  
Important Direction

The connection of the modern psychology and formal systems remains an important direction of research. This paper is centered on philosophical problems surrounding relations between mental and logic. Main attention is given to philosophy of logic but certain ideas are introduced that can be incorporated into the practical philosophical logic. The definition and properties of basic modal logic and descending ones which are used in study of mental activity are in view. The defining role of philosophical interpretation of modality for the particular formal system used for research in the field of psychological states of agents is postulated. Different semantics of modal logic are studied. The hypothesis about the connection of research in cognitive psychology (semantics of brain activity) and formal systems connected to research of psychological states is stated.

Logical Decision Problems and Complexity of Logic Programs

1987 ◽  
Vol 10 (1) ◽  
pp. 1-33
Author(s):  
Egon Börger ◽  
Ulrich Löwen
Keyword(s):  
Fixed Point ◽  
Computational Complexity ◽  
Decision Problem ◽  
Decision Problems ◽  
Complexity Classes ◽  
Logic Programs ◽  
Finite Structures ◽  
Syntactic Restrictions

We survey and give new results on logical characterizations of complexity classes in terms of the computational complexity of decision problems of various classes of logical formulas. There are two main approaches to obtain such results: The first approach yields logical descriptions of complexity classes by semantic restrictions (to e.g. finite structures) together with syntactic enrichment of logic by new expressive means (like e.g. fixed point operators). The second approach characterizes complexity classes by (the decision problem of) classes of formulas determined by purely syntactic restrictions on the formation of formulas.

Informal and formal systems of care for women experiencing intimate partner violence in Kenya

2021 ◽  
pp. 1-24
Author(s):  
Cecilia Mengo ◽  
Bonita B. Sharma ◽  
Brieanne Beaujolais
Keyword(s):  
Intimate Partner Violence ◽  
Partner Violence ◽  
Systems Of Care ◽  
Intimate Partner ◽  
Formal Systems

Completeness for nondeterministic complexity classes

1991 ◽  
Vol 24 (1) ◽  
pp. 179-200 ◽  
Author(s):  
Harry Buhrman ◽  
Steven Homer ◽  
Leen Torenvliet
Keyword(s):  
Complexity Classes

Variants of Courcelle's Theorem for complexity classes inside P

2016 ◽  
Vol 3 (1) ◽  
pp. 23-32
Author(s):  
Michael Elberfeld
Keyword(s):  
Complexity Classes ◽  
Courcelle’S Theorem

scholarly journals Elementary Formal Systems, Intrinsic Complexity, and Procrastination

1997 ◽  
Vol 132 (1) ◽  
pp. 65-84 ◽  
Author(s):  
Sanjay Jain ◽  
Arun Sharma
Keyword(s):  
Formal Systems ◽  
Intrinsic Complexity

scholarly journals Languages that Capture Complexity Classes

1987 ◽  
Vol 16 (4) ◽  
pp. 760-778 ◽  
Author(s):  
Neil Immerman
Keyword(s):  
Complexity Classes
Sign in / Sign up

Export Citation Format

Share Document