EuDML | Browse

Frameworks for interactive theorem proving give the user explicit control over the construction of proofs based on meta languages that contain dedicated control structures for describing proof construction. Such languages are not easy to master and thus contribute to the already long list of skills required by prospective users of interactive theorem provers. Most users, however, only need a convenient formalism that allows to introduce new rules with minimal overhead. On the the other hand, rules...

Tavole semantiche per sistemi astratti di logica estensionale

Flavio Previale (1975)

Rendiconti del Seminario Matematico della Università di Padova

The Completeness And Compactness Of A Three-Valued First-Order Logic.

Itala M.L. D'Ottaviano (1985)

Revista colombiana de matematicas

The Consistency Of A Variant Of Church's Thesis With An Axiomatic Theory Of An Epistemic Notion.

W.N. Reinhardt (1985)

Revista colombiana de matematicas

The elimination of descriptions from A. Bressan’s modal language $M L^{ν}$ on which the logical calculus $M C^{ν}$ is based

Eugenio Giovanni Omodeo (1976)

Rendiconti del Seminario Matematico della Università di Padova

The interpreted type-free modal calculus $M C^{\infty}$

A. Bressan (1974)

Rendiconti del Seminario Matematico della Università di Padova

The interpreted type-free modal calculus $M C^{\infty}$

A. Bressan (1973)

Rendiconti del Seminario Matematico della Università di Padova

The interpreted type-free modal calculus $M C^{\infty}$ . II

A. Bressan (1973)

Rendiconti del Seminario Matematico della Università di Padova

The resolution tableau for logics of likelihood

Zoran Ognjanović (2001)

Kragujevac Journal of Mathematics

Theorem-proving systems [Book]

Ewa Orłowska (1973)

Time conditional propositions

Jan Štěpán (1988)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Topologies, Continuity and Bisimulations

J. M. Davoren (2010)

RAIRO - Theoretical Informatics and Applications

The notion of a bisimulation relation is of basic importance in many areas of computation theory and logic. Of late, it has come to take a particular significance in work on the formal analysis and verification of hybrid control systems, where system properties are expressible by formulas of the modal μ-calculus or weaker temporal logics. Our purpose here is to give an analysis of the concept of bisimulation, starting with the observation that the zig-zag conditions are suggestive of some...

TTL : a formalism to describe local and global properties of distributed systems

A. Masini, A. Maggiolo-Schettini (1992)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Un principe de résolution en logique modale

Luis Fariñas Del Cerro (1984)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Una lógica modal para la geometría esférica de incidencia.

Alfonso Ríder Moyano, Rafael María Rubio Ruiz (2005)

RACSAM

Habitualmente, las geometrías de incidencia están basadas en estructuras bisurtidas formadas por puntos y rectas, y conectadas por una relación entre ambas clases. En lo que sigue, introducimos una estructura monosurtida, que llamamos Marco Esférico de Incidencia, la cual resulta adecuada, para construir una base semántica que permita su consideración en el lenguaje modal. Construiremos así un sistema axiomático para dicho lenguaje, que estaría determinado por la estructura creada, es decir probaremos...

Currently displaying 81 – 100 of 171

Previous Page 5 Next