The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
A closed -term is if, for any other closed term , the lambda theory generated by = is consistent. Recently, it has been introduced a general technique to prove the easiness of -terms through the semantical notion of simple easiness. Simple easiness implies easiness and allows to prove consistency results construction of suitable filter models of -calculus living in the category of complete partial orderings: given a simple easy term and an arbitrary closed term , it is possible to build (in...
The abstract model-theoretic concepts of compactness and Löwenheim-Skolem properties are investigated in the "softer" framework of pre-institutions [18]. Two compactness results are presented in this paper: a more informative reformulation of the compactness theorem for pre-institution transformations, and a theorem on natural equivalences with an abstract form of the first-order pre-institution. These results rely on notions of compact transformation, which are introduced as arrow-oriented generalizations...
The polyadic algebras that arise from the algebraization of the first-order extensions of a SIC are characterized and a representation theorem is proved. Standard implicational calculi (SIC)'s were considered by H. Rasiowa [19] and include classical and intuitionistic logic and their various weakenings and fragments, the many-valued logics of Post and Łukasiewicz, modal logics that admit the rule of necessitation, BCK logic, etc.
A closed -term is if, for any
other closed term , the lambda theory generated by
= is consistent. Recently, it has been introduced
a general technique to prove the easiness of -terms through the
semantical notion of simple easiness. Simple easiness implies easiness and allows to prove
consistency results construction of suitable filter models of
-calculus living in the category of complete partial orderings: given
a simple...
In a previous paper, we introduced the notion of Boolean-like algebra as a generalisation of Boolean algebras to an arbitrary similarity type. In a nutshell, a double-pointed algebra with constants is Boolean-like in case for all the congruences and are complementary factor congruences of . We also introduced the weaker notion of semi-Boolean-like algebra, showing that it retained some of the strong algebraic properties characterising Boolean algebras. In this paper, we continue the investigation...
Download Results (CSV)