The following pages link to Arnon Avron (Q229729):
Displayed 50 items.
- What is relevance logic? (Q392272) (← links)
- Canonical signed calculi with multi-ary quantifiers (Q408550) (← links)
- Efficient reasoning with inconsistent information using C-systems (Q527198) (← links)
- Maximal and premaximal paraconsistency in the framework of three-valued semantics (Q631512) (← links)
- Ideal paraconsistent logics (Q647409) (← links)
- Using typed lambda calculus to implement formal systems on a machine (Q688571) (← links)
- On strict strong constructibility with a compass alone (Q748877) (← links)
- Relevance and paraconsistency - a new approach. II: The formal systems (Q750419) (← links)
- Simple consequence relations (Q809992) (← links)
- A non-deterministic view on non-classical negations (Q813081) (← links)
- Cut-elimination and quantification in canonical systems (Q817707) (← links)
- Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics (Q874747) (← links)
- Gentzenizing Schroeder-Heister's natural extension of natural deduction (Q923083) (← links)
- Non-deterministic semantics for logics with a consistency operator (Q997049) (← links)
- Rough sets and 3-valued logics (Q1005949) (← links)
- Proof systems for reasoning about computation errors (Q1015487) (← links)
- Multi-valued semantics: why and how (Q1037597) (← links)
- On an implication connective of RM (Q1088648) (← links)
- Theorems on strong constructibility with a compass alone (Q1092411) (← links)
- The semantics and proof theory of linear logic (Q1106836) (← links)
- A note of provability, truth and existence (Q1181476) (← links)
- Whither relevance logic? (Q1198408) (← links)
- The value of the four values (Q1274293) (← links)
- A model-theoretic approach for recovering consistent data from inconsistent knowledge bases (Q1284709) (← links)
- Gentzen-type systems, resolution and tableaux (Q1311413) (← links)
- Stability, sequentiality and demand driven evaluation in dataflow (Q1346605) (← links)
- An exercise in an interactive geometrical research (Q1353869) (← links)
- Hypersequents, logical consequence and intermediate logics for concurrency (Q1354077) (← links)
- Encoding modal logics in logical frameworks (Q1577344) (← links)
- A cut-free calculus for second-order Gödel logic (Q1677040) (← links)
- Self-extensional three-valued paraconsistent logics (Q1682293) (← links)
- Four-valued paradefinite logics (Q1685565) (← links)
- Paraconsistent fuzzy logic preserving non-falsity (Q1697334) (← links)
- A minimal computational theory of a minimal computational universe (Q1709687) (← links)
- Combining classical logic, paraconsistency and relevance (Q1775868) (← links)
- On purely relevant logics (Q1820761) (← links)
- Reasoning with logical bilattices (Q1919988) (← links)
- The middle ground-ancestral logic (Q2053352) (← links)
- Basing sequent systems on exclusive-or (Q2142068) (← links)
- Analysis in a formal predicative set theory (Q2148788) (← links)
- First-order quasi-canonical proof systems (Q2180509) (← links)
- The normal and self-extensional extension of Dunn-Belnap logic (Q2198314) (← links)
- The classical constraint on relevance (Q2254555) (← links)
- Relevance and paraconsistency - a new approach. III: Cut-free Gentzen- type systems (Q2277440) (← links)
- Paraconsistency and the need for infinite semantics (Q2317507) (← links)
- Constructibility and decidability versus domain independence and absoluteness (Q2482456) (← links)
- (Q2715514) (← links)
- (Q2721190) (← links)
- A Logical Framework for Developing and Mechanizing Set Theories (Q2817908) (← links)
- (Q2882458) (← links)