Damian Szmuc
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Damian Szmuc has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Federico Pailos
University of Tübingen
5 shared publications - Bruno Da Ré
University of Buenos Aires, Department of Philosophy, Argentina image/svg+xml
4 shared publications - Eduardo Alejandro Barrio
University of Buenos Aires
4 shared publications - Hitoshi Omori
Tohoku University
2 shared publications Martina Zirattu
Universitá degli Studi di Torino, Turin, Italy
2 shared publicationsBruno Da Ré
IIF (CONICET-SADAF) and University of Buenos Aires, Buenos Aires, Argentina
1 shared publication
Latest Publications
- Open Access
- 19 October 2026
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- p. 39 pp.
Non-Deterministic Matrices for Combinations of Canonical and Cocanonical Deduction Systems
This article aims to study, proof-theoretically and semantically, Gentzen-style sequent calculi (including possibly Cut-free and Identity-free systems), containing combinations of canonical and cocanonical rules, i.e. Gentzen systems for sequents, with well-behaved forms of left and right introduction and elimination rules for logical expressions. Our main goals are to provide soundness and completeness results for the derivability relations of the target systems in terms of 2-, 3-, or 4-valued non-deterministic semantics, and to give sufficient conditions under which these calculi are prone to produce well-behaved normal derivations of a structurally-atomic analytic-synthetic kind.
- 19 October 2026
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- p. 39 pp.
Open AccessNon-Deterministic Matrices for Combinations of Canonical and Cocanonical Deduction Systems
This article aims to study, proof-theoretically and semantically, Gentzen-style sequent calculi (including possibly Cut-free and Identity-free systems), containing combinations of canonical and cocanonical rules, i.e. Gentzen systems for sequents, with well-behaved forms of left and right introduction and elimination rules for logical expressions. Our main goals are to provide soundness and completeness results for the derivability relations of the target systems in terms of 2-, 3-, or 4-valued non-deterministic semantics, and to give sufficient conditions under which these calculi are prone to produce well-behaved normal derivations of a structurally-atomic analytic-synthetic kind.
- Open Access
- 4 May 2026
- Published by Instituto de Investigaciones Filosóficas in Análisis Filosófico
- Vol. 46 (1) , 29-60
¿Toda célula tiene un sexo?
El artículo examina críticamente la afirmación de que toda célula tiene un sexo, un enfoque que sostiene que los cromosomas “sexuales” (XX y XY) determinan diferencias biológicas fundamentales a nivel celular. A partir de un análisis interdisciplinario, se cuestiona la validez empírica, conceptual y ontológica de esta postura. Se argumenta que el sexo no es una propiedad fija ni binaria de las células, sino una categoría contextual y dinámica. Finalmente, se proponen enfoques alternativos más adecuados para la investigación biomédica, que permiten un análisis más preciso de la diversidad biológica sin caer en esencialismos.
- 4 May 2026
- Published by Instituto de Investigaciones Filosóficas in Análisis Filosófico
- Vol. 46 (1) , 29-60
Open Access¿Toda célula tiene un sexo?
El artículo examina críticamente la afirmación de que toda célula tiene un sexo, un enfoque que sostiene que los cromosomas “sexuales” (XX y XY) determinan diferencias biológicas fundamentales a nivel celular. A partir de un análisis interdisciplinario, se cuestiona la validez empírica, conceptual y ontológica de esta postura. Se argumenta que el sexo no es una propiedad fija ni binaria de las células, sino una categoría contextual y dinámica. Finalmente, se proponen enfoques alternativos más adecuados para la investigación biomédica, que permiten un análisis más preciso de la diversidad biológica sin caer en esencialismos.
- 10 March 2026
- Published by Springer Nature in Journal of Logic, Language and Information
- p. 1-31
The Algebra of Analytic Containment
- 10 March 2026
- Published by Springer Nature in Journal of Logic, Language and Information
- p. 1-31
The Algebra of Analytic Containment
- 9 December 2025
- Published by Springer Nature in Erkenntnis
- Vol. 91 (7) , 3343-3365
Non-deterministic Semantics for Logics of Analytic Implication
- 9 December 2025
- Published by Springer Nature in Erkenntnis
- Vol. 91 (7) , 3343-3365
Non-deterministic Semantics for Logics of Analytic Implication
- 18 March 2024
- Published by Oxford University Press (OUP) in Analysis
- Vol. 84 (2) , 320-326
Non-transitive counterparts of every Tarskian logic
The aim of this article is to show that, just as in recent years Cobreros, Egré, Ripley and van Rooij have provided a non-transitive counterpart of classical logic (i.e. one in which all classically acceptable inferences are valid but Cut and other metainferences are not), the same can be done for every Tarskian logic, with full generality. To establish this fact, a semantic approach is taken by showing that appropriate structures can be devised to characterize a non-transitive counterpart of every Tarskian logic, starting from the logical matrices that are usually taken to render them.
- 18 March 2024
- Published by Oxford University Press (OUP) in Analysis
- Vol. 84 (2) , 320-326
Non-transitive counterparts of every Tarskian logic
The aim of this article is to show that, just as in recent years Cobreros, Egré, Ripley and van Rooij have provided a non-transitive counterpart of classical logic (i.e. one in which all classically acceptable inferences are valid but Cut and other metainferences are not), the same can be done for every Tarskian logic, with full generality. To establish this fact, a semantic approach is taken by showing that appropriate structures can be devised to characterize a non-transitive counterpart of every Tarskian logic, starting from the logical matrices that are usually taken to render them.
- 18 March 2024
- Published by Springer Nature in Studia Logica
- Vol. 112 (6) , 1243-1259
Non-Reflexive Nonsense: Proof Theory of Paracomplete Weak Kleene Logic
- 18 March 2024
- Published by Springer Nature in Studia Logica
- Vol. 112 (6) , 1243-1259
Non-Reflexive Nonsense: Proof Theory of Paracomplete Weak Kleene Logic
- Open Access
- 1 June 2023
- Published by Cambridge University Press (CUP) in The Bulletin of Symbolic Logic
- Vol. 29 (4) , 703-724
THE 19TH LATIN AMERICAN SYMPOSIUM ON MATHEMATICAL LOGIC OF THE ASSOCIATION FOR SYMBOLIC LOGIC XIX SIMPOSIO LATINOAMERICANO DE LÓGICA MATEMÁTICA Universidad de Costa Rica San José, Costa Rica July 26–31, 2022
Science, model theory, non-classical logics/algebraic logic, philosophy of logic, and set theory), 23 contributed talks, and 2 contributed posters. The following tutorial courses were given.
- 1 June 2023
- Published by Cambridge University Press (CUP) in The Bulletin of Symbolic Logic
- Vol. 29 (4) , 703-724
Open AccessTHE 19TH LATIN AMERICAN SYMPOSIUM ON MATHEMATICAL LOGIC OF THE ASSOCIATION FOR SYMBOLIC LOGIC XIX SIMPOSIO LATINOAMERICANO DE LÓGICA MATEMÁTICA Universidad de Costa Rica San José, Costa Rica July 26–31, 2022
Science, model theory, non-classical logics/algebraic logic, philosophy of logic, and set theory), 23 contributed talks, and 2 contributed posters. The following tutorial courses were given.
- 11 May 2023
- Published by Cambridge University Press (CUP) in The Review of Symbolic Logic
- Vol. 17 (3) , 682-704
ON THREE-VALUED PRESENTATIONS OF CLASSICAL LOGIC
Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logic? We give an answer to this question for the five monotonic consequence relations $st$ , $ss$ , $tt$ , $ss\cap tt$ , and $ts$ , when the connectives are negation, conjunction, and disjunction. For $ts$ and $ss\cap tt$ the answer is trivial (no scheme works), and for $ss$ and $tt$ it is straightforward (they are the collapsible schemes, in which the middle value acts like one of the classical values). For $st$ , the schemes in question are the Boolean normal schemes that are either monotonic or collapsible.- 11 May 2023
- Published by Cambridge University Press (CUP) in The Review of Symbolic Logic
- Vol. 17 (3) , 682-704
ON THREE-VALUED PRESENTATIONS OF CLASSICAL LOGIC
Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logic? We give an answer to this question for the five monotonic consequence relations $st$ , $ss$ , $tt$ , $ss\cap tt$ , and $ts$ , when the connectives are negation, conjunction, and disjunction. For $ts$ and $ss\cap tt$ the answer is trivial (no scheme works), and for $ss$ and $tt$ it is straightforward (they are the collapsible schemes, in which the middle value acts like one of the classical values). For $st$ , the schemes in question are the Boolean normal schemes that are either monotonic or collapsible.- Open Access
- 28 November 2021
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- Vol. 30 (4) , 631-652
Pure Variable Inclusion Logics
The aim of this article is to discuss pure variable inclusion logics, that is, logical systems where valid entailments require that the propositional variables occurring in the conclusion are included among those appearing in the premises, or vice versa. We study the subsystems of Classical Logic satisfying these requirements and assess the extent to which it is possible to characterise them by means of a single logical matrix. In addition, we semantically describe both of these companions to Classical Logic in terms of appropriate matrix bundles and as semilattice-based logics, showing that the notion of consequence in these logics can be interpreted in terms of truth (or non-falsity) and meaningfulness (or meaninglessness) preservation. Finally, we use Płonka sums of matrices to investigate the pure variable inclusion companions of an arbitrary finitary logic.
- 28 November 2021
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- Vol. 30 (4) , 631-652
Open AccessPure Variable Inclusion Logics
The aim of this article is to discuss pure variable inclusion logics, that is, logical systems where valid entailments require that the propositional variables occurring in the conclusion are included among those appearing in the premises, or vice versa. We study the subsystems of Classical Logic satisfying these requirements and assess the extent to which it is possible to characterise them by means of a single logical matrix. In addition, we semantically describe both of these companions to Classical Logic in terms of appropriate matrix bundles and as semilattice-based logics, showing that the notion of consequence in these logics can be interpreted in terms of truth (or non-falsity) and meaningfulness (or meaninglessness) preservation. Finally, we use Płonka sums of matrices to investigate the pure variable inclusion companions of an arbitrary finitary logic.
- Open Access
- 1 November 2021
- Published by Instituto de Investigaciones Filosóficas in Análisis Filosófico
- Vol. 41 (2) , 317-336
Inferentialism and Relevance
This paper provides an inferentialist motivation for a logic belonging in the connexive family, by borrowing elements from the bilateralist interpretation for Classical Logic without the Cut rule, proposed by David Ripley. The paper focuses on the relation between inferentialism and relevance, through the exploration of what we call relevant assertion and denial, showing that a connexive system emerges as a symptom of this interesting link. With the present attempt we hope to broaden the available interpretations for connexive logics, showing they can be rightfully motivated in terms of certain relevantist constraints imposed on assertion and denial.
- 1 November 2021
- Published by Instituto de Investigaciones Filosóficas in Análisis Filosófico
- Vol. 41 (2) , 317-336
Open AccessInferentialism and Relevance
This paper provides an inferentialist motivation for a logic belonging in the connexive family, by borrowing elements from the bilateralist interpretation for Classical Logic without the Cut rule, proposed by David Ripley. The paper focuses on the relation between inferentialism and relevance, through the exploration of what we call relevant assertion and denial, showing that a connexive system emerges as a symptom of this interesting link. With the present attempt we hope to broaden the available interpretations for connexive logics, showing they can be rightfully motivated in terms of certain relevantist constraints imposed on assertion and denial.