# Proof Search on Bilateralist Judgments over Non-deterministic Semantics

@inproceedings{Greati2021ProofSO, title={Proof Search on Bilateralist Judgments over Non-deterministic Semantics}, author={Vitor Rodrigues Greati and S{\'e}rgio Marcelino and J. Martin Marcos}, booktitle={TABLEAUX}, year={2021} }

The bilateralist approach to logical consequence maintains that judgments of different qualities should be taken into account in determining what-follows-from-what. We argue that such an approach may be actualized by a two-dimensional notion of entailment induced by semantic structures that also accommodate non-deterministic and partial interpretations, and propose a prooftheoretical apparatus to reason over bilateralist judgments using symmetrical two-dimensional analytical Hilbert-style…

## One Citation

### Finite two-dimensional proof systems for non-finitely axiomatizable logics

- Philosophy, Computer ScienceIJCAR
- 2022

A recipe for cooking up a two-dimensional logical matrix by the combination of two (possibly partial) non-deterministic logical matrices is introduced and it is shown that such a combination may result in B -matrices satisfying the property of sufﬁcient expressiveness.

## References

SHOWING 1-10 OF 21 REFERENCES

### On Axioms and Rexpansions

- Mathematics
- 2021

We study the general problem of strengthening the logic of a given (partial) (non-deterministic) matrix with a set of axioms, using the idea of rexpansion. We obtain two characterization methods: a…

### Multi-valued Calculi for Logics Based on Non-determinism

- Computer ScienceLog. J. IGPL
- 2005

The Rasiowa-Sikorski (R-S) decomposition methodology is used to get sound and complete proof systems employing finite sets of mv-signed formulas for all propositional logics based on Nmatrices with either of the above types of semantics.

### Infectious semantics and analytic calculi for even more inclusion logics

- Philosophy2020 IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL)
- 2020

It is shown that non-determinism can be used to give simple and effective many-valued semantics to a range of companions of a given many- valued logic that result from filtering its inferences by requiring that variables of the premises and conclusion of an inference respect an inclusion requirement.

### Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics

- Computer ScienceTheor. Comput. Sci.
- 2015

### What is a logical theory? On theories containing assertions and denials

- PhilosophySynthese
- 2019

A novel notion of theory is introduced that attacks the shortcomings of the received notion by allowing one to take both assertions and denials on a par, and is based on a bilateralist approach to consequence operators.

### Analytic Calculi for Monadic PNmatrices

- Computer ScienceWoLLIC
- 2019

It is proved that simple axiomatizations can always be obtained, using inference rules which can have more than one conclusion, which seems to raise a contrast with recent non-analyticity results for sequent-calculi with PNmatrix semantics.

### Possible-translations semantics for some weak classically-based paraconsistent logics

- Philosophy, Computer ScienceJ. Appl. Non Class. Logics
- 2008

In many real-life applications of logic it is useful to interpret a particular sentence as true together with its negation. If we are talking about classical logic, this situation would force all…

### Multi-valued Semantics: Why and How

- Computer ScienceStud Logica
- 2009

It is shown that one can get both modularity and analycity by using the semantic framework of multi-valued non-deterministic matrices, and that for using this framework in a constructive way it is best to view “truth-values” as information carriers, or “information- values”.

### Tarskian consequence relations bilaterally: some familiar notions

- PhilosophySynthese
- 2019

This paper is dedicated to developing a formalism that takes rejection seriously and shows how David Nelson’s logic N4 can be characterized bilaterally and the corresponding completeness result is proved.

### 5-VALUED NON-DETERMINISTIC SEMANTICS FOR THE BASIC PARACONSISTENT LOGIC mCi

- Computer Science, Philosophy
- 2008

This paper presents a 5-valued characteristic nondeterministic matrix for mCi, which provides a quite non-trivial example for the utility and effectiveness of the use of non-deterministic many-valued semantics.