Andrew Tedder
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
Andrew Tedder has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Guillermo Badia
University of Queensland
4 shared publications - Igor Sedlár
Institute of Computer Science, Czech Academy of Sciences, Prague, Czech Republic
3 shared publications - Nicholas Ferenz
Centre of Philosophy, University of Lisbon, Lisbon, Portugal
2 shared publications - Petr Cintula
Institute of Computer Science of the Czech Academy of Sciences
2 shared publications - Wesley Fussner
Czech Academy of Sciences, Institute of Computer Science
2 shared publications - Brandon Rozek
Rensselaer Polytechnic Institute (RPI), Troy, USA
1 shared publication
Latest Publications
- 19 October 2026
- Published by Springer Nature in Journal of Philosophical Logic
- p. 1-17
A Static Model Theory for Modal Expansionism
- 19 October 2026
- Published by Springer Nature in Journal of Philosophical Logic
- p. 1-17
A Static Model Theory for Modal Expansionism
- Open Access
- 9 September 2026
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- p. 10 pp.
Revisiting Interpolation in Relevant Logics
There are exactly two maximal schematic extensions of the relevant logic \(\mathcal{R}\) with the variable sharing property. We establish that one of them has a strong form of interpolation for deducibility, thereby giving an example of a well-known relevant logic with interpolation.- 9 September 2026
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- p. 10 pp.
Open AccessRevisiting Interpolation in Relevant Logics
There are exactly two maximal schematic extensions of the relevant logic \(\mathcal{R}\) with the variable sharing property. We establish that one of them has a strong form of interpolation for deducibility, thereby giving an example of a well-known relevant logic with interpolation. - Open Access
- 24 March 2026
- Published by Springer Nature in Journal of Logic, Language and Information
A Topical Approach to Implication-in-Fiction and Analytic Containment Logics
We develop a topical framework for implication-in-fiction by representing topics as subalgebras, following [12]. We propose an account where those propositions follow within the fiction which (1) follow tout court and (2) are on topic. This is formally modeled in an algebra of propositions as the intersection of a subalgebra and a filter, both of which are generated by the values of the premises under some interpretation of the language in the algebra. We then show how this notion generalises to a Tarskian consequence relation over classes of algebras, and show that in some cases this consequence relation satisfies the Proscriptive Principle ( PP ), and thus is appropriate for logics of analytic containment.
- 24 March 2026
- Published by Springer Nature in Journal of Logic, Language and Information
Open AccessA Topical Approach to Implication-in-Fiction and Analytic Containment Logics
We develop a topical framework for implication-in-fiction by representing topics as subalgebras, following [12]. We propose an account where those propositions follow within the fiction which (1) follow tout court and (2) are on topic. This is formally modeled in an algebra of propositions as the intersection of a subalgebra and a filter, both of which are generated by the values of the premises under some interpretation of the language in the algebra. We then show how this notion generalises to a Tarskian consequence relation over classes of algebras, and show that in some cases this consequence relation satisfies the Proscriptive Principle ( PP ), and thus is appropriate for logics of analytic containment.
- Open Access
- 9 February 2026
- Published by Springer Nature in Journal of Logic, Language and Information
VSPursuer: A Tool for Finding Matrices Witnessing the Variable Sharing Property
We introduce , an automated reasoning tool that analyses matrices generated by Slaney’s . The tool searches these matrices for a target logic to find one that witnesses the logic’s satisfaction of the Variable Sharing Property . We describe the theoretical background behind and highlight optimisations that enable our tool to determine whether a given matrix witnesses the property in polynomial time. We then give some example data sets for particular relevant logics, a theoretical analysis on the sizes of matrices generated by which do not witness variable sharing, and close with an appendix explaining how to install and use .
- 9 February 2026
- Published by Springer Nature in Journal of Logic, Language and Information
Open AccessVSPursuer: A Tool for Finding Matrices Witnessing the Variable Sharing Property
We introduce , an automated reasoning tool that analyses matrices generated by Slaney’s . The tool searches these matrices for a target logic to find one that witnesses the logic’s satisfaction of the Variable Sharing Property . We describe the theoretical background behind and highlight optimisations that enable our tool to determine whether a given matrix witnesses the property in polynomial time. We then give some example data sets for particular relevant logics, a theoretical analysis on the sizes of matrices generated by which do not witness variable sharing, and close with an appendix explaining how to install and use .
- Open Access
Revisiting Interpolation in Relevant Logics
There are exactly two maximal schematic extensions of the relevant logic R with the variable sharing property. We establish that one of them has a strong form of interpolation for deducibility, thereby giving an example of a well-known relevant logic with interpolation.
Open AccessRevisiting Interpolation in Relevant Logics
There are exactly two maximal schematic extensions of the relevant logic R with the variable sharing property. We establish that one of them has a strong form of interpolation for deducibility, thereby giving an example of a well-known relevant logic with interpolation.
- Open Access
- 25 October 2025
- Published by Springer Nature in Erkenntnis
- Vol. 91 (6) , 1-33
Relevance via Topicality in First Order Logics
We investigate the problem of providing relevance properties for first order logics by expanding on recent work concerning relevance as a topical property in propositional relevant logics. We propose a theory of topic for first order languages, relying on the use of focus markers in an extension of the usual first order language, and suggest how such an enrichment of the language and conceptual apparatus of the logic can provide avenues into the first order relevance problem.
- 25 October 2025
- Published by Springer Nature in Erkenntnis
- Vol. 91 (6) , 1-33
Open AccessRelevance via Topicality in First Order Logics
We investigate the problem of providing relevance properties for first order logics by expanding on recent work concerning relevance as a topical property in propositional relevant logics. We propose a theory of topic for first order languages, relying on the use of focus markers in an extension of the usual first order language, and suggest how such an enrichment of the language and conceptual apparatus of the logic can provide avenues into the first order relevance problem.
- Open Access
- 1 January 2025
- Published by Victoria University of Wellington Library in The Australasian Journal of Logic
- Vol. 22 (1) , 8-32
Negated Implications in Connexive Relevant Logics
Connexive expansions of relevant logics tend to prove every negated implication formula. In this paper I discuss why they tend to satisfy this unsavoury property, and discuss avenues by which it can be avoided, providing logics which stand as proofs of concept that these avenues can be made to work.
- 1 January 2025
- Published by Victoria University of Wellington Library in The Australasian Journal of Logic
- Vol. 22 (1) , 8-32
Open AccessNegated Implications in Connexive Relevant Logics
Connexive expansions of relevant logics tend to prove every negated implication formula. In this paper I discuss why they tend to satisfy this unsavoury property, and discuss avenues by which it can be avoided, providing logics which stand as proofs of concept that these avenues can be made to work.
- 19 October 2024
- Published by Springer Nature in Erkenntnis
- Vol. 91 (1) , 23-51
Topics in Relevant Logic: A Semantic Perspective
- 19 October 2024
- Published by Springer Nature in Erkenntnis
- Vol. 91 (1) , 23-51
Topics in Relevant Logic: A Semantic Perspective
- Open Access
- 26 January 2024
- Published by Springer Nature in Journal of Philosophical Logic
- Vol. 53 (2) , 331-349
An Algebraic View of the Mares-Goldblatt Semantics
An algebraic characterisation is given of the Mares-Goldblatt semantics for quantified extensions of relevant and modal logics. Some features of this more general semantic framework are investigated, and the relations to some recent work in algebraic semantics for quantified extensions of non-classical logics are considered.
- 26 January 2024
- Published by Springer Nature in Journal of Philosophical Logic
- Vol. 53 (2) , 331-349
Open AccessAn Algebraic View of the Mares-Goldblatt Semantics
An algebraic characterisation is given of the Mares-Goldblatt semantics for quantified extensions of relevant and modal logics. Some features of this more general semantic framework are investigated, and the relations to some recent work in algebraic semantics for quantified extensions of non-classical logics are considered.
- Open Access
- 15 July 2023
- Published by Springer Nature in Asian Journal of Philosophy
- Vol. 2 (2) , 1-19
No cause for collapse
We investigate a hitherto under-considered avenue of response for the logical pluralist to collapse worries. In particular, we note that standard forms of the collapse arguments seem to require significant order-theoretic assumptions, namely that the collection of admissible logics for the pluralist should be closed under meets and joins. We consider some reasons for rejecting this assumption, noting some prima facie plausible constraints on the class of admissible logics which would lead a pluralist admitting those logics to resist such closure conditions.
- 15 July 2023
- Published by Springer Nature in Asian Journal of Philosophy
- Vol. 2 (2) , 1-19
Open AccessNo cause for collapse
We investigate a hitherto under-considered avenue of response for the logical pluralist to collapse worries. In particular, we note that standard forms of the collapse arguments seem to require significant order-theoretic assumptions, namely that the collection of admissible logics for the pluralist should be closed under meets and joins. We consider some reasons for rejecting this assumption, noting some prima facie plausible constraints on the class of admissible logics which would lead a pluralist admitting those logics to resist such closure conditions.