66 search results - page 1 / 14 » Closed fragments of provability logics of constructive theor... |
JSYML
2008
13 years 7 months ago
2008
In this paper we give a new proof of the characterization of the closed fragment of the provability logic of Heyting's Arithmetic. We also provide a characterization of the c...
DLOG
2010
13 years 5 months ago
2010
A fragment of type theory with OWL class constructions for types and binary properties is used to formalize SysML Structural Block Diagram models. A structural SysML block diagram ...
APAL
2010
13 years 7 months ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
CAV
2009
Springer
14 years 7 months ago
2009
Springer
Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas...
IFSA
2007
Springer
14 years 1 months ago
2007
Springer
In the formal and fully graded setting of Fuzzy Class Theory (or higher-order fuzzy logic) we make an initial investigation into basic notions of fuzzy topology. In particular we s...