Buscar
Mostrando ítems 21-30 de 782
Hilbert-style Presentations of Two Logics Associated to Tetravalent Modal Algebras
(SpringerNew YorkEUA, 2014)
Relation-changing modal logics
(2014)
En esta tesis investigamos operadores modales dinámicos que pueden cambiar el modelo durante la evaluación de una fórmula. En particular, extendemos el lenguaje modal básico con modalidades que son capaces de invertir, ...
Logic TK: algebric notions from Tarski's consequence operator
(2010)
Tarski presented his definition of consequence operator to explain the most important notions which any logical consequence concept must contemplate. A Tarski space is a pair constituted by a nonempty set and a consequence ...
Hypothetical Logic of Proofs
(Springer, 2014-03)
The logic of proofs is a refinement of modal logic introduced by Artemov in 1995 in which the modality ◻A is revisited as ⟦t⟧A where t is an expression that bears witness to the validity of A. It enjoys arithmetical soundness ...
Copy and remove as dynamic operators
(Taylor & Francis, 2021-08)
In this article, we present a modal logic that extends the basic modal logic ML with two dynamic operators: copy (cp), which replicates the current model, labelling each copy with a different propositional symbol and ...
Justification logic and audited computation
(Oxford University Press, 2015-06)
Justification Logic ( JL ) is a refinement of modal logic in which assertions of knowledge and belief are accompanied by justifications: the formula 〚s〛A states that s is a ‘reason’ for knowing/believing A . We study the ...
Temporal Reasoning and MAS
(2011)
Completeness for monadic fuzzy logics via functional algebras
(Elsevier Science, 2021-03-01)
We study S5-modal (monadic) expansions of extensions of Hájek's basic logic . Hájek proposed Hilbert-style systems axiomatizing these logics and we prove that completeness theorems for these logics follow from algebraic ...
Completeness in hybrid type theory
(2014)
We show that basic hybridization (adding nominals and @ operators) makes it possible to give straightforward Henkin-style completeness proofs even when the modal logic being hybridized is higher-order. The key ideas are ...