Zobrazeno 1 - 10
of 58
pro vyhledávání: '"Andrzej Indrzejczak"'
Autor:
Andrzej Indrzejczak, Michał Zawidzki
Publikováno v:
Synthese. 201
Definite descriptions are widely discussed in linguistics and formal semantics, but their formal treatment in logic is surprisingly modest. In this article we present a sound, complete, and cut-free tableau calculus $${\textbf{TC}}_{R_{\lambda }}$$ T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9e2dcf957401bb03bee9a7ed1e7e9e8c
https://doi.org/10.1007/s11229-023-04048-y
https://doi.org/10.1007/s11229-023-04048-y
Autor:
Andrzej Indrzejczak
Publikováno v:
Synthese. 199:4749-4774
A new type of formalization of classical first-order logic with equality is introduced on the basis of the sequent calculus. It serves to justify the claim that equality is a logical constant characterised by well-behaved rules satisfying properties
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e86d72f1fa5fb5a0edfb901c16186b0e
https://doi.org/10.1007/s11229-020-03000-8
https://doi.org/10.1007/s11229-020-03000-8
Autor:
Andrzej Indrzejczak
Publikováno v:
Studia Logica. 109:859-886
The paper presents a uniform proof-theoretic treatment of several kinds of free logic, including the logics of existence and definedness applied in constructive mathematics and computer science, and called here quasi-free logics. All free and quasi-f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8750a74edff3524b13aca66bb0dde560
https://doi.org/10.1007/s11225-020-09929-8
https://doi.org/10.1007/s11225-020-09929-8
Autor:
Andrzej Indrzejczak
We present a uniform syntactical characterization of the class of quasi-relevant logics which are four-valued extensions of the basic relevant logic B of Meyer and Routley. All these logics are obtained by the addition of suitable quasi-relevant impl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::357691e94b2ba022f2d2b6f59602c527
https://doi.org/10.21203/rs.3.rs-1723159/v1
https://doi.org/10.21203/rs.3.rs-1723159/v1
Autor:
Andrzej Indrzejczak, Michał Zawidzki
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 358
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19e9f0f4efe88745b9f6a0f6965c4171
https://doi.org/10.4204/eptcs.358.0
https://doi.org/10.4204/eptcs.358.0
Autor:
Andrzej Indrzejczak
Publikováno v:
Automated Reasoning ISBN: 9783031107689
The ontology of Leśniewski is commonly regarded as the most comprehensive calculus of names and the theoretical basis of mereology. However, ontology was not examined by means of proof-theoretic methods so far. In the paper we provide a characteriza
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4767474009aaf835c48b738c60fc1d8e
https://doi.org/10.1007/978-3-031-10769-6_32
https://doi.org/10.1007/978-3-031-10769-6_32
Autor:
Andrzej Indrzejczak
Publikováno v:
Outstanding Contributions to Logic ISBN: 9783031068423
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef47cd40380149729d9a539795cedbe8
https://doi.org/10.1007/978-3-031-06843-0_3
https://doi.org/10.1007/978-3-031-06843-0_3
Autor:
Andrzej Indrzejczak
Publikováno v:
The Review of Symbolic Logic. 12:806-822
This is a sequel article to [10] where a hypersequent calculus (HC) for some temporal logics of linear frames includingKt4.3and its extensions for dense and serial flow of time was investigated in detail. A distinctive feature of this approach is tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16c757357fc753924a89c2a9105014de
https://doi.org/10.1017/s1755020319000352
https://doi.org/10.1017/s1755020319000352
Autor:
Andrzej Indrzejczak, Michał Zawidzki
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030860585
TABLEAUX
TABLEAUX
The paper provides a tableau approach to definite descriptions. We focus on several formalizations of the so-called minimal free description theory (MFD) usually formulated axiomatically in the setting of free logic. We consider five analytic tableau
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::15f3352bc6a013c3614555efb0d188c7