Unification in intuitionistic logic
From MaRDI portal
Recommendations
Cited in
(97)- Proof theory for admissible rules
- Multiagent temporal logics with multivaluations
- The admissible rules of \(\mathsf{BD}_2\) and \(\mathsf{GSc}\)
- On the logic of unification
- Best solving modal equations
- Structural completeness in many-valued logics with rational constants
- Projectivity in (bounded) commutative integral residuated lattices
- Multiagent temporal logics, unification problems, and admissibilities
- Multi-agent logics with multi-valuations and intensional logical operations
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
- Inference rules in Nelson's logics, admissibility and weak admissibility
- Rules with parameters in modal logic. I.
- Admissibility via natural dualities
- Admissibility in De Morgan algebras
- On the rules of intermediate logics
- Frege systems for extensible modal logics
- Unification and projectivity in De Morgan and Kleene algebras.
- On rules
- Finitary unification in locally tabular modal logics characterized
- Admissible rules for six intuitionistic modal logics
- Hereditarily structurally complete intermediate logics: Citkin's theorem via duality
- Almost structural completeness; an algebraic approach
- Admissible bases via stable canonical rules
- A syntactic approach to unification in transitive reflexive modal logics
- Unification and projectivity in Fregean varieties
- Extending unification in \(\mathcal{EL}\) to disunification: the case of dismatching and local disunification
- 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10
- A tableau method for checking rule admissibility in S4
- scientific article; zbMATH DE number 3851084 (Why is no real title available?)
- Structural completeness in propositional logics of dependence
- 2004 Annual Meeting of the Association for Symbolic Logic
- Hypersequent rules with restricted contexts for propositional modal logics
- Tutorial on admissible rules in Gudauri
- Admissibility and Unifiability in Contact Logics
- A note on extensions: admissible rules via semantics
- 2006–07 Winter Meeting of the Association for Symbolic Logic
- Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics
- Canonical rules
- scientific article; zbMATH DE number 4012606 (Why is no real title available?)
- Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
- On unification and admissible rules in Gabbay-de Jongh logics
- An explicit basis for admissible inference rules in table modal logics of width 2
- Extendible formulas in two variables in intuitionistic logic
- KD is nullary
- Checking admissibility using natural dualities
- Admissibility and refutation: some characterisations of intermediate logics
- Writing out unifiers for formulas with coefficients in intuitionistic logic
- Admissible inference rules in the linear logic of knowledge and time \(\mathrm{LTK}_r\) with intransitive time relation
- DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV
- Multi-Agents’ Temporal Logic using Operations of Static Agents’ Knowledge
- Free Heyting algebra endomorphisms: Ruitenburg’s Theorem and beyond
- Finite frames fail: how infinity works its way into the semantics of admissibility
- Unifying Theories of Logic and Specification
- Unification in first-order transitive modal logic
- The basic intuitionistic logic of proofs
- Filtering unification and most general unifiers in modal logic
- Codimension and pseudometric in co-Heyting algebras
- UNIFICATION IN SUPERINTUITIONISTIC PREDICATE LOGICS AND ITS APPLICATIONS
- Splittings of lattices of theories and unification types
- Logical consecutions in discrete linear temporal logic
- Intermediate logics and Visser's rules
- scientific article; zbMATH DE number 966894 (Why is no real title available?)
- Formal Methods in Software and Systems Modeling
- Preservation of admissible rules when combining logics
- Unification and Inference Rules in the Multi-modal Logic of Knowledge and Linear Time LTK
- Unification in Linear Modal Logic on Non-transitive Time with the Universal Modality
- Proof complexity of non-classical logics
- Rules and arithmetics
- Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic
- Unification, finite duality and projectivity in varieties of Heyting algebras
- Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
- Dynamic temporal logical operations in multi-agent logics
- Structural and universal completeness in algebra and logic
- Admissibility and unification in the modal logics related to S4.2
- Algebraic and logical aspects of unification
- Unification and Finite Model Property for Linear Step-Like Temporal Multi-Agent Logic with the Universal Modality
- A coalgebraic approach to non-determinism: applications to multilattices
- Admissible rules in the implication-negation fragment of intuitionistic logic
- Best unifiers in transitive modal logics
- Unification in Łukasiewicz Logic with a Finite Number of Variables
- Linear step-like logic of knowledge \(\mathcal{LTK}.{sl} \)
- Notes on my scientific life
- Deciding dependence in logic and algebra
- About the unification types of modal logics
- Unification types and union splittings in intermediate logics
- Universal proof theory: feasible admissibility in intuitionistic modal logics
- Relative unification in intuitionistic logic: towards the provability logic of HA
- Unification in subsystems of polymodal provability logic GLP
- Computing most general unifiers in Euclidean modal logics
- Investigating definability in propositional logic via sheaves on Grothendieck topologies
- Projective relative unification through duality
- On the unification problem for \(\operatorname{GLP} \)
- Unification in linear temporal logic LTL
- Temporal logic with accessibility temporal relations generated by time states themselves
- Complexity of admissible rules
- Branching time logics \(\mathcal {BTL}^{\text{U,S}}_{\text{N},\text{N}^{-1}}(\mathcal {Z})_{\alpha }\) with operations \textit{Until} and \textit{Since} based on bundles of integer numbers, logical consecutions, deciding algorithms
- Linear temporal logic with until and next, logical consecutions
This page was built for publication: Unification in intuitionistic logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4262590)
