ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Social Sciences
Economy
Philosophy
Technology
Literature
Languages
Computing
Architecture and Urbanism
Religion
all records (73)

Languages
English
Spanish
Portuguese
German
French

Countries
Indonesia
Brazil
USA
Ukraine
Cuba
Spain
South Africa
Denmark
Poland
Canada
all records (76)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
9.880  Articles
1 of 988 pages  |  10  records  |  more records»
In previous work by Baaz and Iemhoff, a Gentzen calculus for intuitionistic logic with existence predicate is presented that satisfies partial cut elimination and Craig's interpolation property; it is also conjectured that interpolation fails for the impl... see more

We investigate monadic fragments of Intuitionistic Control Logic (ICL), which is obtained from Intuitionistic Propositional Logic (IPL) by extending language of IPL by a constant distinct from intuitionistic constants. In particular we present the complet... see more

A natural deduction system NI, for the full propositional intuitionistic logic, is proposed. The operational rules of NI are obtained by the translation from Gentzen’s calculus LJ and the normalization is proved, via translations from sequent calculus der... see more

In this contribution, we introduce the concepts of logical entropy and logical mutual information of experiments in the intuitionistic fuzzy case, and study the basic properties of the suggested measures. Subsequently, by means of the suggested notion of ... see more

In [1] J.-Y. Bèziau formulated a logic called Z. Bèziau’s idea was generalized independently in [6] and [7]. A family of logics to which Z belongs is denoted in [7] by K. In particular; it has been shown in [6] and [7] that there is a correspondence betwe... see more

The temporal logic KtT4 is the modal logic obtained from the minimal temporal logic Kt by requiring the accessibility relation to be reflexive (which corresponds to the axiom T) and transitive (which corresponds to the axiom 4). This article aims, firstly... see more

We describe in full detail a solution to the problem of proving the cut elimination theorem for FILL, a variant of (multiplicative and exponential-free) Linear Logicintroduced by Hyland and de Paiva. Hyland and de Paiva's work used a term assignmentsystem... see more

Recently, Coquand and Palmgren considered systems of intuitionistic arithmeticin all finite types together with various forms of the axiom of choice anda numerical omniscience schema (NOS) which implies classical logic for arithmeticalformulas. Feferman s... see more

The paper is devoted to the study of one of the aspects of the so-called Evidence Algorithm programme advanced by Academician V.M.~Glushkov and connected with the problem of automated theorem-proving search in the signature of first-order t... see more

1 of 988 pages  |  10  records  |  more records»