Proof theory, semantics and algebra for normative systems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof Theory, Semantics and Algebra for Normative Systems

This paper reports correspondence results between input/ output logic and the theory of joining-systems. The results have the form: every norm (a, x) is logically derivable from a set of norms G if and only if it is in the space of norms algebraically generated by G.

متن کامل

Abstract Normative Systems: Semantics and Proof Theory

Normative Systems: Semantics and Proof Theory Silvano Colombo Tosatto SnT, University of Luxembourg Luxembourg Guido Boella University of Turin Italy Leendert van der Torre University of Luxembourg Luxembourg Serena Villata INRIA France

متن کامل

Proof by Consistency in Constructive Systems with Final Algebra Semantics

In this paper we study nal algebra semantics for constructive equational systems. A class of models of a constructive system is described, and proven to have a nal algebra. Then we develop a method for proof by consistency with respect to the nal model. Finally we show that the method contains the proof methods of Musser [11], Goguen [2], and Huet and Hullot [5] as special cases.

متن کامل

Proof Theory and Algebra in Substructural Logics

It is quite well understood that propositional logics are tightly connected to ordered algebras via algebraic completeness, and because of this connection proof theory is often useful in the algebraic context too. A prominent example is that one deductively proves the interpolation theorem for a given logic in order to derive the algebraic amalgamation property for the corresponding variety as ...

متن کامل

Classical BI: Its Semantics and Proof Theory

We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O’Hearn and Pym’s logic of bunched implications BI. CBI differs from existing bunched logics in that its multiplicative connectives behave classically rather than intuitionistically (including in particular a multiplicative version of classical negation). At the semantic level, CBI-formulas have th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Logic and Computation

سال: 2015

ISSN: 1465-363X,0955-792X

DOI: 10.1093/logcom/exv022