allameh tabatabaei has proposed the last and the shortest formulation of the “seddiqin argument” of which javadi amoli believes it provides no philosophical presuppositions and therefore can be the first question in islamic philosophy. the claim has yielded controversies pro and con. in the papers written on the subject matter, the claim has been criticized in particular and not in general. i t...

Dependence logic is a new logic which incorporates the notion of “dependence”, as well as “independence” between variables into first-order logic. In this thesis, we study extensions and variants of dependence logic on the first-order, propositional and modal level. In particular, the role of intuitionistic connectives in this setting is emphasized. We obtain, among others, the following result...

We consider the binary relations of parallelism and convergence between lines in a 2-dimensional affine space. Associating with parallelism and convergence the binary predicates P and C and the modal connectives [P ] and [C], we consider a first-order theory based on these predicates and a modal logic based on these modal connectives. We investigate the axiomatization/completeness and the decid...

We define an interpretation of modal languages with polyadic operators in modal languages that use monadic operators (diamonds) only. We also define a simulation operator which associates a logic Λ in the diamond language with each logic Λ in the language with polyadic modal connectives. We prove that this simulation operator transfers several useful properties of modal logics, such as finite/r...

For conventional logic institutions, when one extends the sentences to contain open sentences, their satisfaction is then parameterized. For instance, in the first-order logic, the satisfaction is parameterized by the valuation of unbound variables, while in modal logics it is further by possible worlds. This paper proposes a uniform treatment of such parameterization of the satisfaction relati...

We present the experience gained from implementing a new decision procedure for both graded and probabilistic modal logic. While our approach uses standard tableaux for propositional connectives, modal rules are given by linear constraints on the arguments of operators. The implementation uses binary decision diagrams for propositional connectives and a linear programming library for the modal ...

The paper presents a tableau calculus for a linear time tem poral logic for reasoning about processes and events in concurrent sys tems The logic is based on temporal connectives in the style of Transac tion Logic BK and explicit quanti cation over states The language extends rst order logic with sequential and parallel conjunction parallel disjunction and temporal implication Explicit quanti c...

We present a proposal on how to develop nonmonotonic reasoning based on the modal logic S4. As a consequence of our results we show how to present the well known semantics of answer sets, under a restricted fragment of modal formulas, using this approach. Moreover, by considering the full set of modal formulas we obtain an interesting generalization of answer sets with modal connectives. We sho...

The topological semantics for modal logic interprets a standard modal propositional language in topological spaces rather than Kripke frames: the most general logic of topological spaces becomes S4. But othermodal logics can be given a topological semantics by restricting attention to subclasses of topological spaces: in particular, S5 is logic of the class of almost discrete topological spaces...

In this thesis (modal) dependence logic is investigated. It was introduced in 2007 by Jouko Väänänen as an extension of first-order (resp. modal) logic by the dependence operator “p ̈q. For first-order (resp. propositional) variables x1, . . . , xn, “px1, . . . , xn ́1, xnq intuitively states that the value of xn is determined by those of x1, . . . , xn ́1. We consider fragments of modal dependenc...