The following pages link to Anna Zamansky (Q408549):
Displayed 41 items.
- Canonical signed calculi with multi-ary quantifiers (Q408550) (← links)
- Efficient reasoning with inconsistent information using C-systems (Q527198) (← links)
- A framework for reasoning under uncertainty based on non-deterministic distance semantics (Q541819) (← links)
- Simplified forms of computerized reasoning with distance semantics (Q545150) (← links)
- Maximal and premaximal paraconsistency in the framework of three-valued semantics (Q631512) (← links)
- Ideal paraconsistent logics (Q647409) (← links)
- Cut-elimination and quantification in canonical systems (Q817707) (← links)
- A `natural logic' inference system using the Lambek calculus (Q851198) (← links)
- A graded approach to database repair by context-aware distance semantics (Q1677932) (← links)
- Reasoning with graded information: the case of diagnostic rating scales in healthcare (Q1677943) (← links)
- Keeping logic in the trivium of computer science: a teaching perspective (Q1696593) (← links)
- Automating automated reasoning. The case of two generic automated reasoning tools (Q2185494) (← links)
- A dissimilarity-based framework for generating inconsistency-tolerant logics (Q2254632) (← links)
- Finite-valued semantics for canonical labelled calculi (Q2351396) (← links)
- Gen2sat: An Automated Tool for Deciding Derivability in Analytic Pure Sequent Calculi (Q2817945) (← links)
- Effective Finite-Valued Semantics for Labelled Calculi (Q2908477) (← links)
- A Preferential Framework for Trivialization-Resistant Reasoning with Inconsistent Information (Q2915092) (← links)
- Taming Paraconsistent (and Other) Logics (Q2946751) (← links)
- Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics (Q2986784) (← links)
- Basic Constructive Connectives, Determinism and Matrix-Based Semantics (Q3010364) (← links)
- Paraconsistency, self-extensionality, modality (Q3386899) (← links)
- Distance-based non-deterministic semantics for reasoning with uncertainty (Q3391739) (← links)
- Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism (Q3392939) (← links)
- Automated Support for the Investigation of Paraconsistent and Other Logics (Q3455840) (← links)
- A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics (Q3503624) (← links)
- Reasoning with Uncertainty by Nmatrix–Metric Semantics (Q3511449) (← links)
- Canonical calculi with (n,k)-ary quantifiers (Q3535607) (← links)
- Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination (Q3605518) (← links)
- Canonical Gentzen-Type Calculi with (n,k)-ary Quantifiers (Q3613413) (← links)
- Non-deterministic Distance Semantics for Handling Incomplete and Inconsistent Data (Q3638199) (← links)
- (Q4636024) (← links)
- (Q4686539) (← links)
- (Q4918414) (← links)
- Similarity-Based Inconsistency-Tolerant Logics (Q4930750) (← links)
- Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work) (Q5020161) (← links)
- Context-Aware Distance Semantics for Inconsistent Database Systems (Q5230062) (← links)
- On recent applications of paraconsistent logic: an exploratory literature review (Q5243397) (← links)
- Cut-free sequent calculi for C-systems with generalized finite-valued semantics (Q5300580) (← links)
- Many-Valued Non-deterministic Semantics for First-Order Logics of Formal (In)consistency (Q5425994) (← links)
- Generalized Non-deterministic Matrices and (n,k)-ary Quantifiers (Q5434496) (← links)
- (Q5446288) (← links)