default search action
Logica Universalis, Volume 1
Volume 1, Number 1, January 2007
- Jean-Yves Béziau:
Preface. 1-2 - Peter Arndt, Rodrigo de Alvarenga Freire, Odilon Otavio Luciano, Hugo Luiz Mariano:
A Global Glance on Categories in Logic. 3-39 - Arnon Avron, Jonathan Ben-Naim, Beata Konikowska:
Cut-Free Ordinary Sequent Calculi for Logics Having Generalized Finite-Valued Semantics. 41-70 - Carlos Caleiro, Jaime Ramos:
From Fibring to Cryptofibring. A Solution to the Collapsing Problem. 71-92 - Carlos Iván Chesñevar, Guillermo Ricardo Simari:
Modelling Inference in Argumentation through Labelled Deduction: Formalization and Logical Properties. 93-124 - Johan van Benthem:
A New Modal Lindström Theorem. 125-138 - Jürg Kohlas, Robert F. Stärk:
Information Algebras and Consequence Operators. 139-165 - Arnold Koslow:
Structuralist Logic: Implications, Inferences, and Consequences. 167-181 - David W. Miller:
Some Restricted Lindenbaum Theorems Equivalent to the Axiom of Choice. 183-199 - Robert A. Herrmann:
General Logic-Systems and Finite Consequence Operators. 201-208 - Stan J. Surma:
A Galois Connection. 209-219 - Diderik Batens:
A Universal Logic Approach to Adaptive Logics. 221-242
Volume 1, Number 2, October 2007
- Steffen Lewitzka:
Abstract Logics, Logic Maps, and Logic Homomorphisms. 243-276 - Vladimir L. Vasyukov:
Structuring the Universe of Universal Logic. 277-294 - Gillman Payette, Peter K. Schotch:
On Preserving. 295-310 - Katalin Bimbó:
Functorial Duality for Ortholattices and De Morgan Lattices. 311-333 - Casey McGinnis:
Some Multi-Conclusion Modal Paralogics. 335-353 - Peter Schroeder-Heister:
Generalized Definitional Reflection and the Inversion Principle. 355-376 - Marcelo E. Coniglio:
Recovering a Logic from Its Fragments by Meta-Fibring. 377-416
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.