#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1994

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Tatiana Yavorskaya
- Theory of Computing Systems
- 2007

Logic of proofs $\mathsf{LP}$ , introduced by S. Artemov, originally designed for describing properties of formal proofs, now became a basis for the theory of knowledge with justification (cf. S. Artemov, Evidence-based common knowledge, Technical report TR–2004018, CUNY Ph.D. Program in Computer Science, 2005). So far, in epistemic systems with… (More)

- Tatiana Yavorskaya
- Ann. Pure Appl. Logic
- 2001

- Tatiana Yavorskaya
- LFCS
- 1997

This report consists of two separate parts, essentially two oversized footnotes to the article " Sequential Abstract State Machines Capture Sequential Algorithms " by Yuri Gurevich. In Chapter I, Yuri Gurevich and Tatiana Yavorskaya present and study a more abstract version of the bounded exploration postulate. In Chapter II, Tatiana Yavorskaya gives a… (More)

- Tatiana Yavorskaya, Natalia Rubtsova
- Journal of Applied Non-Classical Logics
- 2007

- Tatiana Yavorskaya
- CSR
- 2006

- Tatiana Yavorskaya
- J. Log. Comput.
- 2005

Logic of proofs LP introduced by S. Artemov in 1995 describes properties of proof predicate " t is a proof of F " in the propositional language extended by atoms of the form [[t]]F. Proof are represented by terms constructed by three elementary recursive operations on proofs. In order to make the language more expressive we introduce the additional storage… (More)

- Sergei N. Artemov, Tatiana Yavorskaya, Tatiana Yavorskaya Sidon
- 2016

The propositional logic of proofs LP revealed an explicit provability reading of modal logic S4 which provided an indented provability semantics for the propositional intuitionistic logic IPC and led to a new area, Justification Logic. In this paper, we find the first-order logic of proofs FOLP capable of realizing first-order modal logic S4 and, therefore,… (More)

- Tatiana Yavorskaya
- J. Log. Comput.
- 2006

- Sergei N. Artëmov, Tatiana Yavorskaya
- J. Log. Comput.
- 2016

The standard first-order reading of modality does not bind individual variables, i.e., if x is free in F (x), then x remains free in 2F (x). Accordingly, if 2 stands for 'provable in arithmetic,' ∀x2F (x) states that F (n) is provable for any given value of n = 0, 1, 2,. . .; this corresponds to a de re reading of modality. The other, de dicto meaning of 2F… (More)