We present a framework for machine implementation of families of non-classical logics with Kripke-style semantics. We decompose a logic into two interacting parts, each a natural deduction system: a base logic of labelled formulae, and a theory of labels characterizing the properties of the Kripke models. By appropriate combinations we capture both partial and complete fragments of large families of non-classical logics such as modal, relevance, and intuitionistic logics. Our approach is modular and supports uniform proofs of soundness, completeness and (...) proof normalization. We have implemented our work in the Isabelle Logical Framework. (shrink)

Ėstetika antichnosti -- Ėstetika srednikh vekov -- Ėstetika vozrozhdenii︠a︡ -- Ėstetika frant︠s︡uzskogo prosveshchenii︠a︡ -- Ėstetika nemet︠s︡kogo prosveshchenii︠a︡ -- Ėstetika angliĭskogo prosveshchenii︠a︡ -- Ėstetika "Buri i natiska" -- Nemet︠s︡kai︠a︡ klassicheskai︠a︡ ėstetika.

В книгу вошли высказывания об искусстве и воображении философов, эстетиков, психологов, искусствоведов и мастеров искусства.

Вниманию читателя предлагаются статьи, посвященные мало исследованным проблемам логики (и психологии) художественного творчества, в частности в работах М. Бахтина. Книга содержит также хрестоматию "Искусство и логика" и предметный указатель.

Издание содержит: хрестоматия; философы; психологи; литературоведы, искусствоведы; мастер изобразительного искусства и др.

In previous work, we introduced a version of distributed temporal logic that is well-suited both for verifying security protocols and as a metalogic for reasoning about, and relating, different security protocol models. In this paper, we formally investigate the relationship between our approach and strand spaces, which is one of the most successful and widespread formalisms for analyzing security protocols. We define translations between models in our logic and strand-space models of security protocols, and we compare the results obtained with (...) respect to the level of abstraction that is inherent in each of the formalisms. This allows us to clarify different aspects of strand spaces that are often left implicit, as well as pave the way to transfer results, techniques and tools across the two approaches. (shrink)

In previous work we gave an approach, based on labelled natural deduction, for formalizing proof systems for a large class of propositional modal logics that includes K, D, T, B, S4, S4.2, KD45, and S5. Here we extend this approach to quantified modal logics, providing formalizations for logics with varying, increasing, decreasing, or constant domains. The result is modular with respect to both properties of the accessibility relation in the Kripke frame and the way domains of individuals change between worlds. (...) Our approach has a modular metatheory too; soundness, completeness and normalization are proved uniformly for every logic in our class. Finally, our work leads to a simple implementation of a modal logic theorem prover in a standard logical framework. (shrink)