Sequent systems for nondeterministic propositional logics without reflexivity

Kuijer, LB ORCID: 0000-0001-6696-9023 (2013) Sequent systems for nondeterministic propositional logics without reflexivity In: 4th International Workshop on Logic, Rationality, and Interaction (LORI).

Text Sequent_systems_for_nondeterministic_propositional_logics_without_reflexivity.pdf - Author Accepted Manuscript Download (297kB)

Abstract

In order to deal with ambiguity in statements made in a natural language I introduce nondeterministic semantics for propositional logic with an arbitrary set C of connectives. The semantics are based on the idea that Γ entails if and only if every possible deterministic disambiguation of Γ entails every possible deterministic disambiguation of . I also introduce a cut-free sequent style proof system S<inf>C</inf> that is sound and complete for the given semantics. Finally I show that while the semantics and proof system do not satisfy reflexivity they do allow certain kinds of substitution of equivalents. © 2013 Springer-Verlag.

Item Type:	Conference Item (Unspecified)
Uncontrolled Keywords:	46 Information and Computing Sciences
Depositing User:	Symplectic Admin
Date Deposited:	30 Nov 2018 10:52
Last Modified:	24 Jan 2026 01:52
DOI:	10.1007/978-3-642-40948-6_15
Related Websites:	Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3029215
Disclaimer:	The University of Liverpool is not responsible for content contained on other websites from links within repository metadata. Please contact us if you notice anything that appears incorrect or inappropriate.