Both propositional dependence logic and inquisitive logic are expressively complete. As a consequence, every formula in the language of inquisitive logic with intuitionistic disjunction or intuitionistic implication can be translated equivalently into a formula in the language of propositional dependence logic without these two connectives. We show that although such a (noncompositional) transl...

Abstract We show that intuitionistic logic is deductively equivalent to Connexive Heyting Logic ( $$\textrm{CHL}$$ CHL ), hereby introduced as an example of a strongly connexive with intuitive semantics. use the reverse algebraisation paradigm: presented assertional point regular variety (whose structur...

The Intuitionistic Fuzzy Sets (IFSs), proposed in 1983, are extensions of fuzzy sets. Some years after their introduction, sequentially, intuitionistic fuzzy propositional logic, intuitionistic fuzzy predicate logic, intuitionistic fuzzy modal logic and intuitionistic fuzzy temporal logic have been introduced, presented here shortly. During the last 25 years, different intuitionistic fuzzy tool...

The multi-valued logic of Lukasiewicz is a substructural logic that has been widely studied and has many interesting properties. It is classical, in the sense that it admits the axiom schema of double negation elimination, [DNE]. However, our understanding of Lukasiewicz logic can be improved by separating its classical and intuitionistic aspects. The intuitionistic aspect of Lukasiewicz logic ...

This thesis develops techniques and ideas on proof search. Proof search is used with one of two meanings. Proof search can be thought of either as the search for a yes/no answer to a query (theorem proving), or as the search for all proofs of a formula (proof enumeration). This thesis is an investigation into issues in proof search in both these senses for some non-classical logics. Gentzen sys...

We introduce e ectiveness considerations into model theory of intuitionistic logic. We investigate e ectiveness of completeness (by Kripke) results for intermediate logics such as for example, intuitionistic logic, classical logic, constant domain logic, directed frames logic, Dummett's logic, etc.

We characterize provability in intuitionistic logic with equality in terms of a constraint calculus. This characterization uncovers close connections between provability in intuitionistic logic with equality and solutions to simultaneous rigid E-uniication. We show that the problem of existence of a sequent proof with a given skeleton is polynomial-time equivalent to simultaneous rigid E-uniiab...

In this thesis, we consider bi-intuitionistic logic and tense logic, as well as the combined bi-intuitionistic tense logic. Each of these logics contains a pair of dual connectives, for example, Rauszer’s bi-intuitionistic logic [100] contains intuitionistic implication and dual intuitionistic exclusion. The interaction between these dual connectives makes it non-trivial to develop a cut-free s...

This paper describes the categorical semantics of a system of mixed intuitionistic and linear type theory (ILT). ILT was proposed by G. Plotkin and also independently by P. Wadler. The logic associated with ILT is obtained as a combination of intuitionistic logic with intuitionistic linear logic, and can be embedded in Barber and Plotkin's Dual Intuitionistic Linear Logic (DILL). However, unlik...