Pages that link to "Item:Q3278334"
From MaRDI portal
The following pages link to Concerning formulas of the types <i>A→B</i> ν <i>C,A →(Ex)B(x)</i> in intuitionistic formal systems (Q3278334):
Displaying 39 items.
- Natural deduction for the Sheffer stroke and Peirce's arrow (and any other truth-functional connective) (Q288247) (← links)
- On unification and admissible rules in Gabbay-de Jongh logics (Q386639) (← links)
- Admissibility and refutation: some characterisations of intermediate logics (Q481867) (← links)
- Admissible inference rules in the linear logic of knowledge and time \(\mathrm{LTK}_r\) with intransitive time relation (Q498234) (← links)
- Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition (Q606997) (← links)
- On specifications, subset types and interpretation of proposition in type theory (Q688736) (← links)
- Admissible inference rules and semantic property of modal logics (Q823963) (← links)
- Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus (Q920971) (← links)
- 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 (Q929294) (← links)
- Linear temporal logic with until and next, logical consecutions (Q947268) (← links)
- A criterion for admissibility of rules in the modal system S4 and intuitionistic logic (Q1079558) (← links)
- On two problems of Harvey Friedman (Q1140629) (← links)
- A semantics for \(\lambda \)Prolog (Q1349686) (← links)
- The ``relevance'' of intersection and union types (Q1381437) (← links)
- The semantics of entailment omega (Q1430899) (← links)
- Admissibility in positive logics (Q1689558) (← links)
- The admissible rules of \(\mathsf{BD}_2\) and \(\mathsf{GSc}\) (Q1782237) (← links)
- Hereditarily structurally complete superintuitionistic deductive systems (Q1790607) (← links)
- Extraction and verification of programs by analysis of formal proofs (Q1823656) (← links)
- Metacompleteness of substructural logics (Q1935554) (← links)
- Rudimentary Kripke models for the intuitionistic propositional calculus (Q2367411) (← links)
- On the rules of intermediate logics (Q2501166) (← links)
- Failure of completeness in proof-theoretic semantics (Q2516584) (← links)
- Some applications of Gentzens second consistency proof (Q2535674) (← links)
- On maximal intermediate predicate constructive logics (Q2563458) (← links)
- Incompleteness of intuitionistic propositional logic with respect to proof-theoretic semantics (Q2631650) (← links)
- Uniform proofs as a foundation for logic programming (Q2640596) (← links)
- A Tableau Method for Checking Rule Admissibility in S4 (Q3185759) (← links)
- The Story of $$\gamma $$ γ (Q3305422) (← links)
- METAVALUATIONS (Q4602434) (← links)
- ON NON-MONOTONOUS PROPERTIES OF SOME CLASSICAL AND NONCLASSICAL PROPOSITIONAL PROOF SYSTEMS (Q5100154) (← links)
- HEREDITARILY STRUCTURALLY COMPLETE POSITIVE LOGICS (Q5117590) (← links)
- Multiple Conclusion Rules in Logics with the Disjunction Property (Q5283419) (← links)
- UNIFICATION IN SUPERINTUITIONISTIC PREDICATE LOGICS AND ITS APPLICATIONS (Q5381031) (← links)
- PRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICS (Q5737940) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
- Upper and lower bounds for the height of proofs in sequent calculus for intuitionistic logic (Q6147867) (← links)
- Admissible inference rules of modal WCP-logics (Q6193927) (← links)
- An explicit basis for \textit{WCP}-globally admissible inference rules (Q6199357) (← links)
