 | Up a level |
Luo, Jieting; Dastani, Mehdi; Studer, Thomas (2023). Getting Emotional from Emotions: Modeling Affective Reaction in Multi-agent Systems (Submitted). Journal of logic and computation Oxford University Press
Lehnherr, David; Ognjanović, Zoran; Studer, Thomas (2022). A logic of interactive proofs. Journal of logic and computation, 32(8), pp. 1645-1658. Oxford University Press 10.1093/logcom/exac071
Faroldi, Federico L G; Ghari, Meghdad; Lehmann, Eveline; Studer, Thomas (2022). Consistency and permission in deontic justification logic (In Press). Journal of logic and computation Oxford University Press 10.1093/logcom/exac045
Baur, Michael; Studer, Thomas (2021). Semirings of Evidence. Journal of logic and computation, 31(8), pp. 2084-2106. Oxford University Press 10.1093/logcom/exab007
Kokkinis, Ioannis; Ognjanović, Zoran; Studer, Thomas (2020). Probabilistic justification logic. Journal of logic and computation, 30(1), pp. 257-280. Oxford University Press 10.1093/logcom/exaa011
Brünnler, Kai; Flumini, Dandolo; Studer, Thomas (2020). A Logic of Blockchain Updates. Journal of logic and computation, 30(8), pp. 1469-1485. Oxford University Press 10.1093/logcom/exaa045
Marinkovic, Bojan; Glavan, Paola; Ognjanovic, Zoran; Studer, Thomas (2019). A temporal epistemic logic with a non-rigid set of agents for analyzing the blockchain protocol. Journal of logic and computation, 29(5), pp. 803-830. Oxford University Press 10.1093/logcom/exz007
Frittaion, Emanuele; Pelupessy, Florian; Steila, Silvia; Yokoyama, Keita (2018). The strength of SCT soundness. Journal of logic and computation, 28(6), pp. 1217-1242. Oxford University Press 10.1093/logcom/exy003
Metcalfe, George (2016). An Avron rule for fragments of R-mingle. Journal of logic and computation, 26(1), pp. 381-393. Oxford University Press 10.1093/logcom/ext031
Jacquette, Dale (2012). Causal Relevance and Relevant Causation. Journal of logic and computation, 22(1), pp. 101-112. Oxford: Oxford University Press 10.1093/logcom/exp065
Baaz, Matthias; Metcalfe, George (2010). Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic. Journal of logic and computation, 20(1), pp. 35-54. Oxford: Oxford University Press 10.1093/logcom/exn059
Bou, Félix; Paoli, Francesco; Ledda, Antonio; Spinks, Matthew; Giuntini, Roberto (2010). The Logic of Quasi-MV Algebras. Journal of logic and computation, 20(2), pp. 619-643. Oxford University Press 10.1093/logcom/exp080
Alberucci, Luca (2009). Sequent calculi for the modal mu-calculus over S5. Journal of logic and computation, 19(6), pp. 971-985. Oxford: Oxford University Press 10.1093/logcom/exn106
Studer, Thomas (2001). A Semantics for λ: a Calculus with Overloading and Late‐binding. Journal of logic and computation, 11(4), pp. 527-544. Oxford University Press 10.1093/logcom/11.4.527
Goré, Rajeev; Heinle, Wolfgang; Heuerding, Alain (1997). Relations between Propositional Normal Modal Logics: an Overview. Journal of logic and computation, 7(5), pp. 649-658. Oxford University Press 10.1093/logcom/7.5.649
Strahm, Thomas (1996). Partial Applicative Theories and Explicit Substitutions. Journal of logic and computation, 6(1), pp. 55-77. Oxford University Press 10.1093/logcom/6.1.55
Künzi, Urs-Martin (1993). Logic Programs for Primitive Recursive Sets. Journal of logic and computation, 3(4), pp. 401-415. Oxford University Press 10.1093/logcom/3.4.401
Stärk, Robert F. (1991). A Complete Axiomatization of the Three valued Completion of Logic Programs. Journal of logic and computation, 1(6), pp. 811-834. Oxford University Press 10.1093/logcom/1.6.811
