#### Figures and Topics from this paper

#### 491 Citations

Automated Reasoning: 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part I

- Computer Science
- IJCAR
- 2020

Hosts of Invited Talks Domain-Specific Reasoning with Satisfiability Modulo Theories is presented, which aims to provide a scaffolding for model-agnostic decision-making in the domain-specific domain. Expand

Definability in the class of all -frames – computability and complexity

- Mathematics, Computer Science
- J. Appl. Non Class. Logics
- 2017

It is shown that the problems of modal definability of first-order sentences over the class of all frames in the languages and are both PSPACE-complete. Expand

Franco Montagna’s Work on Provability Logic and Many-valued Logic

- Mathematics, Computer Science
- Stud Logica
- 2016

Some of the results and ideas of Franco Montagna are surveyed in the two disciplines he greatly contributed along his career: provability logic and many-valued logic. Expand

Artificial Intelligence: Methods and Applications

- Computer Science
- Lecture Notes in Computer Science
- 2014

It is confirmed that the simple Cross-Validation with model selection is indeed optimistic (overestimates) in small sample scenarios and the Nested Cross Validation and the method by Tibshirani and TibshIRani provide conservative estimations, with the later protocol being more computationally efficient. Expand

Canonical Filtrations and Local Tabularity

- Mathematics, Computer Science
- Advances in Modal Logic
- 2014

A special type of filtration in modal logic called “canonical”, known since the 1970s, is applied in a systematic way, allowing to prove new results on finite model property (and in some cases — local tabularity) for different polymodal logics. Expand

Variants of multi-relational semantics for propositional non-normal modal logics

- Mathematics, Computer Science
- J. Appl. Non Class. Logics
- 2014

This work systematically study multi-relational structures, whose investigation is still relatively underdeveloped, and offers completeness proofs for several systems using both strong and weak semantic tools. Expand

Logic in Nonmonotonic Reasoning

- 2011

We present a conceptual description of nonmonotonic formalisms as essentially two-layered reasoning systems consisting of a monotonic logical system, coupled with a mechanism of a reasoned choice of… Expand

Interpolation and implicit definability in extensions of the provability logic

- Mathematics
- 2008

The provability logic GL was in the field of interest of A.V. Kuznetsov, who had also formulated its intuitionistic analog—the intuitionistic provability logic—and investigated these two logics and… Expand

Modal Formulas True at Some Point in Every Model

- Mathematics
- 2008

In a paper on the logical work of the Jains, Graham Priest considers a consequence relation, semantically characterized, which has a natural analogue in modal logic. Here we give a… Expand

Definable fixed points in modal and temporal logics — a survey

- Mathematics, Computer Science
- J. Appl. Non Class. Logics
- 2007

The paper presents a survey of author's results on definable fixed points in modal, temporal, and intuitionistic propositional logics and investigates the positive case, giving a classification of fixed point theorems, and describing some classes of models with definable least fixed points ofpositive operators, special positive operators, and some examples of undefinable leastfixed points. Expand

#### References

SHOWING 1-8 OF 8 REFERENCES

the following schema, which was first defined in [Zeman

- 1968

Hintikka schema and condition) we corrected several mistakes and improved notation

Underlined text is turned into italized. • Sections in our text are numbered 1.1, 1.2, 1.3, etc.; not just 1, 2, 3, etc. • We added subsections

We know (for example from the proof of Lemma 2.2.1) that there can be found a Boolean combination A of formulas in Ψ such that A

• A frame is denoted by F , not F

• Names of modal systems are boldfaced: K4, S5; in the original text, they are not distinguished. • Names of schemata (modal formulas) are sans-serif: K, Q, S, etc. by Fm, not Φ. • The "by definition

• The set of possible worlds is denoted by W , not U ; a typical world is w ∈ W , not u ∈ U . • A (neighborhood or relational) model is denoted by M

• We write propositional letters as p n , not P n