A note on undecidable extensions of monadic second order successor arithmetic.
A one axiom set theory based on higher order predicate calculus.
A Parigot-style linear -calculus for full intuitionistic linear logic.
A possibility-free logic of descriptions.
A possible modal reformulation of comprehension scheme
A proof of Rasiowa-Sikorski theorem via complete sequences
A Proof Procedure for the First Order Logic
A property of the solvable radical in finitely decidable varieties
It is shown that in a finitely decidable equational class, the solvable radical of any finite subdirectly irreducible member is comparable to all congruences of the irreducible if the type of the monolith is 2. In the type 1 case we establish that the centralizer of the monolith is strongly solvable.
A proposal concerning the formulation of the infinitistic axiom in the theory of logical probability
A Propositional p-adic Probability Logic
A reduction-based theorem prover for 3-valued logic.
We present a new prover for propositional 3-valued logics, TAS-M3, which is an extension of the TAS-D prover for classical propositional logic. TAS-M3 uses the TAS methodology and, consequently, it is a reduction-based method. Thus, its power is based on the reductions of the size of the formula executed by the F transformation. This transformation dynamically filters the information contained in the syntactic structure of the formula to avoid as much distributions as possible, in order to improve...
A remark on a paper of Taimanov
A Revision about the Concept of Intentionality in an Approximate Framework.
A selection property of the boolean -calculus and some of its applications
A Semantical Analysis of Implicational System I and of the First Degree of Entailment.
A semantical hierarchy for modal formulas.
In this paper a semantical partition, relative to Kripke models, is introduced for sets of formulas. Secondly, this partition is used to generate a semantical hierarchy for modal formulas. In particular some results are given for the propositional calculi T and S4.
A Survey of the m-M Calculus
A system for deduction-based formal verification of workflow-oriented software models
The work concerns formal verification of workflow-oriented software models using the deductive approach. The formal correctness of a model's behaviour is considered. Manually building logical specifications, which are regarded as a set of temporal logic formulas, seems to be a significant obstacle for an inexperienced user when applying the deductive approach. A system, along with its architecture, for deduction-based verification of workflow-oriented models is proposed. The process inference is...
A Tableaux System in Modal Logic
A theorem on implication functions defined from triangular norms.
Several transformation which enable implication functions in multivalued logics to be generated from conjunctions have been proposed in the literature. It is proved that for a rather general class of conjunctions modeled by triangular norms, the generation process is closed, thus shedding some light on the relationships between seemingly independent classes of implication functions.