From, Asta Halkjær; Schlichtkrull, Anders; Villadsen, Jørgen A sequent calculus for first-order logic formalized in Isabelle/HOL. (English) Zbl 07696225 J. Log. Comput. 33, No. 4, 818-836 (2023). MSC: 03-XX 68-XX PDFBibTeX XMLCite \textit{A. H. From} et al., J. Log. Comput. 33, No. 4, 818--836 (2023; Zbl 07696225) Full Text: DOI
Wehrung, Friedrich Projective classes as images of accessible functors. (English) Zbl 07655497 J. Log. Comput. 33, No. 1, 90-135 (2023). MSC: 03-XX 68-XX PDFBibTeX XMLCite \textit{F. Wehrung}, J. Log. Comput. 33, No. 1, 90--135 (2023; Zbl 07655497) Full Text: DOI
Zielenkiewicz, Maciej; Schubert, Aleksy Automata theory approach to predicate intuitionistic logic. (English) Zbl 07582717 J. Log. Comput. 32, No. 3, 554-580 (2022). MSC: 03-XX 68-XX PDFBibTeX XMLCite \textit{M. Zielenkiewicz} and \textit{A. Schubert}, J. Log. Comput. 32, No. 3, 554--580 (2022; Zbl 07582717) Full Text: DOI
Andrews, Uri; Lempp, Steffen; Mustafa, Manat; Schweber, Noah D. The first-order theory of the computably enumerable equivalence relations in the uncountable setting. (English) Zbl 07471451 J. Log. Comput. 32, No. 1, 98-114 (2022). MSC: 03-XX 68-XX PDFBibTeX XMLCite \textit{U. Andrews} et al., J. Log. Comput. 32, No. 1, 98--114 (2022; Zbl 07471451) Full Text: DOI
Lyon, Tim On the correspondence between nested calculi and semantic systems for intuitionistic logics. (English) Zbl 1509.03033 J. Log. Comput. 31, No. 1, 213-265 (2021). MSC: 03B20 03F03 03F05 PDFBibTeX XMLCite \textit{T. Lyon}, J. Log. Comput. 31, No. 1, 213--265 (2021; Zbl 1509.03033) Full Text: DOI arXiv
Leivant, Daniel Finitism, imperative programs and primitive recursion. (English) Zbl 1509.03122 J. Log. Comput. 31, No. 1, 179-192 (2021). MSC: 03D20 03F30 03A05 PDFBibTeX XMLCite \textit{D. Leivant}, J. Log. Comput. 31, No. 1, 179--192 (2021; Zbl 1509.03122) Full Text: DOI
Kushida, Hirohiko Constructive truth and falsity in Peano arithmetic. (English) Zbl 1509.03163 J. Log. Comput. 31, No. 1, 168-178 (2021). MSC: 03F50 03F30 PDFBibTeX XMLCite \textit{H. Kushida}, J. Log. Comput. 31, No. 1, 168--178 (2021; Zbl 1509.03163) Full Text: DOI arXiv
Forster, Yannick; Kirst, Dominik; Wehr, Dominik Completeness theorems for first-order logic analysed in constructive type theory. Extended version. (English) Zbl 07471462 J. Log. Comput. 31, No. 1, 112-151 (2021). MSC: 03F50 03B35 03B38 03B10 PDFBibTeX XMLCite \textit{Y. Forster} et al., J. Log. Comput. 31, No. 1, 112--151 (2021; Zbl 07471462) Full Text: DOI
Gorzny, Jan; Postan, Ezequiel; Woltzenlogel Paleo, Bruno Lifting propositional proof compression algorithms to first-order logic. (English) Zbl 07451572 J. Log. Comput. 31, No. 8, 1903-1932 (2021). MSC: 03-XX 68-XX PDFBibTeX XMLCite \textit{J. Gorzny} et al., J. Log. Comput. 31, No. 8, 1903--1932 (2021; Zbl 07451572) Full Text: DOI
Rybakov, Mikhail; Shkatov, Dmitry Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages. (English) Zbl 07398783 J. Log. Comput. 31, No. 5, 1266-1288 (2021). MSC: 03-XX 68-XX PDFBibTeX XMLCite \textit{M. Rybakov} and \textit{D. Shkatov}, J. Log. Comput. 31, No. 5, 1266--1288 (2021; Zbl 07398783) Full Text: DOI arXiv
Rybakov, Mikhail; Shkatov, Dmitry Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages. (English) Zbl 07285871 J. Log. Comput. 30, No. 7, 1305-1329 (2020). MSC: 03-XX 68-XX PDFBibTeX XMLCite \textit{M. Rybakov} and \textit{D. Shkatov}, J. Log. Comput. 30, No. 7, 1305--1329 (2020; Zbl 07285871) Full Text: DOI arXiv
Coniglio, Marcelo E.; Figallo-Orellano, Aldo; Golzio, Ana C. First-order swap structures semantics for some logics of formal inconsistency. (English) Zbl 07285868 J. Log. Comput. 30, No. 6, 1257-1290 (2020). MSC: 03-XX 68-XX PDFBibTeX XMLCite \textit{M. E. Coniglio} et al., J. Log. Comput. 30, No. 6, 1257--1290 (2020; Zbl 07285868) Full Text: DOI arXiv
Fitting, Melvin; Salvatore, Felipe First-order justification logic with constant domain semantics. (English) Zbl 1515.03069 J. Log. Comput. 30, No. 1, 193-216 (2020). MSC: 03B42 03B45 PDFBibTeX XMLCite \textit{M. Fitting} and \textit{F. Salvatore}, J. Log. Comput. 30, No. 1, 193--216 (2020; Zbl 1515.03069) Full Text: DOI arXiv
Hella, Lauri T.; Vilander, Miikka S. Formula size games for modal logic and \(\mu\)-calculus. (English) Zbl 1444.03059 J. Log. Comput. 29, No. 8, 1311-1344 (2019). MSC: 03B45 PDFBibTeX XMLCite \textit{L. T. Hella} and \textit{M. S. Vilander}, J. Log. Comput. 29, No. 8, 1311--1344 (2019; Zbl 1444.03059) Full Text: DOI arXiv
Álvez, Javier; Hermo, Montserrat; Lucio, Paqui; Rigau, German Automatic white-box testing of first-order logic ontologies. (English) Zbl 1442.68225 J. Log. Comput. 29, No. 5, 723-751 (2019). MSC: 68T30 03B70 68V15 PDFBibTeX XMLCite \textit{J. Álvez} et al., J. Log. Comput. 29, No. 5, 723--751 (2019; Zbl 1442.68225) Full Text: DOI arXiv
Szwast, Wiesław; Tendera, Lidia On the satisfiability problem for fragments of two-variable logic with one transitive relation. (English) Zbl 1444.03011 J. Log. Comput. 29, No. 6, 881-911 (2019). MSC: 03B25 03B20 68Q25 PDFBibTeX XMLCite \textit{W. Szwast} and \textit{L. Tendera}, J. Log. Comput. 29, No. 6, 881--911 (2019; Zbl 1444.03011) Full Text: DOI arXiv
Amidei, Jacopo; Andrews, Uri; Pianigiani, Duccio; San Mauro, Luca; Sorbi, Andrea Trial and error mathematics: dialectical systems and completions of theories. (English) Zbl 1444.03142 J. Log. Comput. 29, No. 1, 157-184 (2019). MSC: 03D80 03A10 03A05 03D55 03F30 PDFBibTeX XMLCite \textit{J. Amidei} et al., J. Log. Comput. 29, No. 1, 157--184 (2019; Zbl 1444.03142) Full Text: DOI arXiv Link
Balbiani, Philippe; Georgiev, Dimiter; Tinchev, Tinko Modal correspondence theory in the class of all Euclidean frames. (English) Zbl 1444.03042 J. Log. Comput. 28, No. 1, 119-131 (2018). MSC: 03B45 06D22 03B25 PDFBibTeX XMLCite \textit{P. Balbiani} et al., J. Log. Comput. 28, No. 1, 119--131 (2018; Zbl 1444.03042) Full Text: DOI Link
Leitsch, Alexander; Peltier, Nicolas; Weller, Daniel CERES for first-order schemata. (English) Zbl 1405.03089 J. Log. Comput. 27, No. 7, 1897-1954 (2017). Reviewer: Graham E. Leigh (Göteborg) MSC: 03F05 PDFBibTeX XMLCite \textit{A. Leitsch} et al., J. Log. Comput. 27, No. 7, 1897--1954 (2017; Zbl 1405.03089) Full Text: DOI arXiv
Găină, Daniel Downward Löwenheim-Skolem theorem and interpolation in logics with constructors. (English) Zbl 1444.03187 J. Log. Comput. 27, No. 6, 1717-1752 (2017). MSC: 03G30 03B10 03B38 68Q65 PDFBibTeX XMLCite \textit{D. Găină}, J. Log. Comput. 27, No. 6, 1717--1752 (2017; Zbl 1444.03187) Full Text: DOI
Steren, Gabriela; Bonelli, Eduardo The first-order hypothetical logic of proofs. (English) Zbl 1404.03019 J. Log. Comput. 27, No. 4, 1023-1066 (2017). Reviewer: Damas Gruska (Bratislava) MSC: 03B45 03B40 03F45 PDFBibTeX XMLCite \textit{G. Steren} and \textit{E. Bonelli}, J. Log. Comput. 27, No. 4, 1023--1066 (2017; Zbl 1404.03019) Full Text: DOI Link
Balbiani, Philippe; Tinchev, Tinko Undecidable problems for modal definability. (English) Zbl 1444.03043 J. Log. Comput. 27, No. 3, 901-920 (2017). MSC: 03B45 03B25 03D35 PDFBibTeX XMLCite \textit{P. Balbiani} and \textit{T. Tinchev}, J. Log. Comput. 27, No. 3, 901--920 (2017; Zbl 1444.03043) Full Text: DOI
Lamotte-Schubert, Manuel; Weidenbach, Christoph BDI: a new decidable clause class. (English) Zbl 1444.03015 J. Log. Comput. 27, No. 2, 441-468 (2017). MSC: 03B35 03B25 03B10 PDFBibTeX XMLCite \textit{M. Lamotte-Schubert} and \textit{C. Weidenbach}, J. Log. Comput. 27, No. 2, 441--468 (2017; Zbl 1444.03015) Full Text: DOI
Eberhard, Sebastian; Hetzl, Stefan; Weller, Daniel Boolean unification with predicates. (English) Zbl 1407.68217 J. Log. Comput. 27, No. 1, 109-128 (2017). MSC: 68Q25 03B10 03B25 03B35 03C10 68T15 PDFBibTeX XMLCite \textit{S. Eberhard} et al., J. Log. Comput. 27, No. 1, 109--128 (2017; Zbl 1407.68217) Full Text: DOI Link
Khatami, S. M. A.; Pourmahdian, M.; Tavana, N. R. From rational Gödel logic to ultrametric logic. (English) Zbl 1354.03029 J. Log. Comput. 26, No. 5, 1743-1767 (2016). MSC: 03B52 03C90 PDFBibTeX XMLCite \textit{S. M. A. Khatami} et al., J. Log. Comput. 26, No. 5, 1743--1767 (2016; Zbl 1354.03029) Full Text: DOI arXiv
Świechowski, Maciej; Mańdziuk, Jacek Fast interpreter for logical reasoning in general game playing. (English) Zbl 1354.68052 J. Log. Comput. 26, No. 5, 1697-1727 (2016). MSC: 68N20 03B70 68N17 91-08 91A90 PDFBibTeX XMLCite \textit{M. Świechowski} and \textit{J. Mańdziuk}, J. Log. Comput. 26, No. 5, 1697--1727 (2016; Zbl 1354.68052) Full Text: DOI
Chaudhuri, Kaustuv; Hetzl, Stefan; Miller, Dale A multi-focused proof system isomorphic to expansion proofs. (English) Zbl 1403.03118 J. Log. Comput. 26, No. 2, 577-603 (2016). MSC: 03F07 03B10 03F03 03F05 PDFBibTeX XMLCite \textit{K. Chaudhuri} et al., J. Log. Comput. 26, No. 2, 577--603 (2016; Zbl 1403.03118) Full Text: DOI
Ramanayake, Revantha Embedding the hypersequent calculus in the display calculus. (English) Zbl 1348.03054 J. Log. Comput. 25, No. 3, 921-942 (2015). MSC: 03F03 03B45 03B47 03B10 03F05 PDFBibTeX XMLCite \textit{R. Ramanayake}, J. Log. Comput. 25, No. 3, 921--942 (2015; Zbl 1348.03054) Full Text: DOI
Olkhovikov, Grigory K. Model-theoretic characterization of intuitionistic predicate formulas. (English) Zbl 1338.03008 J. Log. Comput. 24, No. 4, 809-829 (2014). MSC: 03B20 PDFBibTeX XMLCite \textit{G. K. Olkhovikov}, J. Log. Comput. 24, No. 4, 809--829 (2014; Zbl 1338.03008) Full Text: DOI arXiv
Davis, Ernest The expressive power of first-order topological languages. (English) Zbl 1345.03024 J. Log. Comput. 23, No. 5, 1107-1141 (2013). MSC: 03B30 68T27 PDFBibTeX XMLCite \textit{E. Davis}, J. Log. Comput. 23, No. 5, 1107--1141 (2013; Zbl 1345.03024) Full Text: DOI
Bodirsky, Manuel; Hermann, Miki; Richoux, Florian Complexity of existential positive first-order logic. (English) Zbl 1270.03062 J. Log. Comput. 23, No. 4, 753-760 (2013). MSC: 03D15 03B10 03B25 68Q25 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., J. Log. Comput. 23, No. 4, 753--760 (2013; Zbl 1270.03062) Full Text: DOI arXiv
Pourmahdian, Massoud; Tavana, Nazanin R. Compactness in first-order Gödel logics. (English) Zbl 1306.03012 J. Log. Comput. 23, No. 3, 473-485 (2013). Reviewer: Brunella Gerla (Varese) MSC: 03B52 PDFBibTeX XMLCite \textit{M. Pourmahdian} and \textit{N. R. Tavana}, J. Log. Comput. 23, No. 3, 473--485 (2013; Zbl 1306.03012) Full Text: DOI
Davis, Ernest Elementarily equivalent structures for topological languages over regions in Euclidean space. (English) Zbl 1285.03038 J. Log. Comput. 23, No. 3, 457-471 (2013). MSC: 03C64 68T27 PDFBibTeX XMLCite \textit{E. Davis}, J. Log. Comput. 23, No. 3, 457--471 (2013; Zbl 1285.03038) Full Text: DOI
Lahav, Ori; Avron, Arnon A semantic proof of strong cut-admissibility for first-order Gödel logic. (English) Zbl 1284.03255 J. Log. Comput. 23, No. 1, 59-86 (2013). MSC: 03F05 03B52 03B55 PDFBibTeX XMLCite \textit{O. Lahav} and \textit{A. Avron}, J. Log. Comput. 23, No. 1, 59--86 (2013; Zbl 1284.03255) Full Text: DOI
Hussak, Walter Monodic temporal logic with quantified propositional variables. (English) Zbl 1262.03033 J. Log. Comput. 22, No. 3, 517-544 (2012). Reviewer: Joost-Pieter Katoen (Aachen) MSC: 03B44 03B25 03D80 PDFBibTeX XMLCite \textit{W. Hussak}, J. Log. Comput. 22, No. 3, 517--544 (2012; Zbl 1262.03033) Full Text: DOI Link
Kolokolova, Antonina Expressing versus proving: relating forms of complexity in logic. (English) Zbl 1256.03045 J. Log. Comput. 22, No. 2, 267-280 (2012). Reviewer: Roman Murawski (Poznań) MSC: 03D15 03C13 03F20 03F30 PDFBibTeX XMLCite \textit{A. Kolokolova}, J. Log. Comput. 22, No. 2, 267--280 (2012; Zbl 1256.03045) Full Text: DOI
Ma, Yue; Qi, Guilin; Hitzler, Pascal Computing inconsistency measure based on paraconsistent semantics. (English) Zbl 1228.68046 J. Log. Comput. 21, No. 6, 1257-1281 (2011). MSC: 68T27 03B53 68T30 PDFBibTeX XMLCite \textit{Y. Ma} et al., J. Log. Comput. 21, No. 6, 1257--1281 (2011; Zbl 1228.68046) Full Text: DOI Link
Goldblatt, Robert Cover semantics for quantified lax logic. (English) Zbl 1247.03028 J. Log. Comput. 21, No. 6, 1035-1063 (2011). Reviewer: Damas Gruska (Bratislava) MSC: 03B45 03B20 68Q60 PDFBibTeX XMLCite \textit{R. Goldblatt}, J. Log. Comput. 21, No. 6, 1035--1063 (2011; Zbl 1247.03028) Full Text: DOI
Mundici, Daniele A compact \([0,1]\)-valued first-order Łukasiewicz logic with identity on Hilbert space. (English) Zbl 1220.03010 J. Log. Comput. 21, No. 3, 509-525 (2011). Reviewer: Salvatore Sessa (Napoli) MSC: 03B50 PDFBibTeX XMLCite \textit{D. Mundici}, J. Log. Comput. 21, No. 3, 509--525 (2011; Zbl 1220.03010) Full Text: DOI
Găină, Daniel; Petria, Marius Completeness by forcing. (English) Zbl 1233.03063 J. Log. Comput. 20, No. 6, 1165-1186 (2010). MSC: 03G30 03C75 03C95 PDFBibTeX XMLCite \textit{D. Găină} and \textit{M. Petria}, J. Log. Comput. 20, No. 6, 1165--1186 (2010; Zbl 1233.03063) Full Text: DOI
Montagna, Franco; Noguera, Carles Arithmetical complexity of first-order predicate fuzzy logics over distinguished semantics. (English) Zbl 1198.03032 J. Log. Comput. 20, No. 2, 399-424 (2010). Reviewer: Siegfried J. Gottwald (Leipzig) MSC: 03B52 03D35 03B50 PDFBibTeX XMLCite \textit{F. Montagna} and \textit{C. Noguera}, J. Log. Comput. 20, No. 2, 399--424 (2010; Zbl 1198.03032) Full Text: DOI Link
Peltier, Nicolas Bottom-up construction of semantic tableaux. (English) Zbl 1193.03029 J. Log. Comput. 20, No. 1, 283-308 (2010). Reviewer: Nail Zamov (Kazan) MSC: 03B35 03B10 68T15 PDFBibTeX XMLCite \textit{N. Peltier}, J. Log. Comput. 20, No. 1, 283--308 (2010; Zbl 1193.03029) Full Text: DOI
Cruz-Filipe, Luís; Rasga, João; Sernadas, Amílcar; Sernadas, Cristina Complete axiomatization of discrete-measure almost-everywhere quantification. (English) Zbl 1157.03014 J. Log. Comput. 18, No. 6, 885-911 (2008). MSC: 03C80 03B10 PDFBibTeX XMLCite \textit{L. Cruz-Filipe} et al., J. Log. Comput. 18, No. 6, 885--911 (2008; Zbl 1157.03014) Full Text: DOI Link
Moniri, Morteza On the hierarchy of intuitionistic bounded arithmetic. (English) Zbl 1147.03032 J. Log. Comput. 18, No. 4, 625-630 (2008). Reviewer: Roman Murawski (Poznań) MSC: 03F30 PDFBibTeX XMLCite \textit{M. Moniri}, J. Log. Comput. 18, No. 4, 625--630 (2008; Zbl 1147.03032) Full Text: DOI
Gabbay, Murdoch J.; Mathijssen, Aad One-and-a-halfth-order logic. (English) Zbl 1158.03006 J. Log. Comput. 18, No. 4, 521-562 (2008). Reviewer: M. Yasuhara (Princeton) MSC: 03B10 03F05 03G99 PDFBibTeX XMLCite \textit{M. J. Gabbay} and \textit{A. Mathijssen}, J. Log. Comput. 18, No. 4, 521--562 (2008; Zbl 1158.03006) Full Text: DOI
Kashima, Ryo; Okamoto, Keishi General models and completeness of first-order modal \(\mu \)-calculus. (English) Zbl 1150.03008 J. Log. Comput. 18, No. 4, 497-507 (2008). Reviewer: Lutz Schröder (Bremen) MSC: 03B45 03B70 PDFBibTeX XMLCite \textit{R. Kashima} and \textit{K. Okamoto}, J. Log. Comput. 18, No. 4, 497--507 (2008; Zbl 1150.03008) Full Text: DOI
Dalmau, Víctor; Krokhin, Andrei; Larose, Benoit First-order definable retraction problems for posets and reflexive graphs. (English) Zbl 1129.03017 J. Log. Comput. 17, No. 1, 31-51 (2007). Reviewer: Yuri Movsisyan (Yerevan) MSC: 03C40 03B10 03C13 05C99 06A06 68Q19 PDFBibTeX XMLCite \textit{V. Dalmau} et al., J. Log. Comput. 17, No. 1, 31--51 (2007; Zbl 1129.03017) Full Text: DOI Link
Bauer, Sebastian Axiomatizing the monodic fragment of QCTL. (English) Zbl 1116.03013 J. Log. Comput. 17, No. 1, 7-30 (2007). Reviewer: Giacomo Bonanno (Davis) MSC: 03B44 PDFBibTeX XMLCite \textit{S. Bauer}, J. Log. Comput. 17, No. 1, 7--30 (2007; Zbl 1116.03013) Full Text: DOI
Davis, Ernest The expressivity of quantifying over regions. (English) Zbl 1116.03011 J. Log. Comput. 16, No. 6, 891-916 (2006). MSC: 03B30 03D80 68T27 68T30 68U05 PDFBibTeX XMLCite \textit{E. Davis}, J. Log. Comput. 16, No. 6, 891--916 (2006; Zbl 1116.03011) Full Text: DOI
Gaĭnă, Daniel; Popescu, Andrei An institution-independent generalization of Tarski’s elementary chain theorem. (English) Zbl 1123.03058 J. Log. Comput. 16, No. 6, 713-735 (2006). Reviewer: Răzvan Diaconescu (Ploiesti) MSC: 03G30 03B10 03C40 PDFBibTeX XMLCite \textit{D. Gaĭnă} and \textit{A. Popescu}, J. Log. Comput. 16, No. 6, 713--735 (2006; Zbl 1123.03058) Full Text: DOI
Conradie, Willem; Goranko, Valentin; Vakarelov, Dimiter Algorithmic correspondence and completeness in modal logic. II: Polyadic and hybrid extensions of the algorithm SQEMA. (English) Zbl 1128.03005 J. Log. Comput. 16, No. 5, 579-612 (2006). MSC: 03B35 03B45 PDFBibTeX XMLCite \textit{W. Conradie} et al., J. Log. Comput. 16, No. 5, 579--612 (2006; Zbl 1128.03005) Full Text: DOI
Balbiani, Philippe; Tinchev, Tinko Definability over the class of all partitions. (English) Zbl 1116.03015 J. Log. Comput. 16, No. 5, 541-557 (2006). MSC: 03B45 03B25 PDFBibTeX XMLCite \textit{P. Balbiani} and \textit{T. Tinchev}, J. Log. Comput. 16, No. 5, 541--557 (2006; Zbl 1116.03015) Full Text: DOI
Moniri, Morteza An independence result for intuitionistic bounded arithmetic. (English) Zbl 1102.03056 J. Log. Comput. 16, No. 2, 199-204 (2006). MSC: 03F30 PDFBibTeX XMLCite \textit{M. Moniri}, J. Log. Comput. 16, No. 2, 199--204 (2006; Zbl 1102.03056) Full Text: DOI
Terwijn, Sebastiaan A. Probabilistic logic and induction. (English) Zbl 1083.03028 J. Log. Comput. 15, No. 4, 507-515 (2005). MSC: 03B48 68T05 PDFBibTeX XMLCite \textit{S. A. Terwijn}, J. Log. Comput. 15, No. 4, 507--515 (2005; Zbl 1083.03028) Full Text: DOI Link
Beklemishev, Lev D.; Joosten, Joost J.; Vervoort, Marco A finitary treatment of the closed fragment of Japaridze’s provability logic. (English) Zbl 1080.03038 J. Log. Comput. 15, No. 4, 447-463 (2005). Reviewer: Osamu Sonobe (Follonica) MSC: 03F45 03B45 03F30 03F15 PDFBibTeX XMLCite \textit{L. D. Beklemishev} et al., J. Log. Comput. 15, No. 4, 447--463 (2005; Zbl 1080.03038) Full Text: DOI Link
Beckmann, Arnold Uniform proof complexity. (English) Zbl 1082.03049 J. Log. Comput. 15, No. 4, 433-446 (2005). MSC: 03F20 03B05 03F30 PDFBibTeX XMLCite \textit{A. Beckmann}, J. Log. Comput. 15, No. 4, 433--446 (2005; Zbl 1082.03049) Full Text: DOI Link
Stapleton, Gem; Howse, John; Taylor, John; Thompson, Simon The expressiveness of spider diagrams. (English) Zbl 1067.03015 J. Log. Comput. 14, No. 6, 857-880 (2004). MSC: 03B20 03C07 PDFBibTeX XMLCite \textit{G. Stapleton} et al., J. Log. Comput. 14, No. 6, 857--880 (2004; Zbl 1067.03015) Full Text: DOI Link
Goranko, Valentin; Vakarelov, Dimiter Sahlqvist formulas in hybrid polyadic modal logics. (English) Zbl 0993.03013 J. Log. Comput. 11, No. 5, 737-754 (2001). Reviewer: Giacomo Bonanno (Davis) MSC: 03B45 PDFBibTeX XMLCite \textit{V. Goranko} and \textit{D. Vakarelov}, J. Log. Comput. 11, No. 5, 737--754 (2001; Zbl 0993.03013) Full Text: DOI
Tourlakis, George On the soundness and completeness of equational predicate logics. (English) Zbl 1006.03007 J. Log. Comput. 11, No. 4, 623-653 (2001). MSC: 03B10 PDFBibTeX XMLCite \textit{G. Tourlakis}, J. Log. Comput. 11, No. 4, 623--653 (2001; Zbl 1006.03007) Full Text: DOI
Laan, Twan; Franssen, Michael Embedding first-order logic in a pure type system with parameters. (English) Zbl 1006.03014 J. Log. Comput. 11, No. 4, 545-557 (2001). MSC: 03B40 03B10 PDFBibTeX XMLCite \textit{T. Laan} and \textit{M. Franssen}, J. Log. Comput. 11, No. 4, 545--557 (2001; Zbl 1006.03014) Full Text: DOI
Barua, Rana; Roy, Suman; Zhou, Chaochen Completeness of neighbourhood logic. (English) Zbl 0999.03017 J. Log. Comput. 10, No. 2, 271-295 (2000). MSC: 03B44 03B70 68Q60 PDFBibTeX XMLCite \textit{R. Barua} et al., J. Log. Comput. 10, No. 2, 271--295 (2000; Zbl 0999.03017) Full Text: DOI Link
Baldwin, John T. Stability, the finite cover property and 0-1 laws. (English) Zbl 0952.03030 J. Log. Comput. 10, No. 2, 209-212 (2000). MSC: 03C13 03C45 03C80 PDFBibTeX XMLCite \textit{J. T. Baldwin}, J. Log. Comput. 10, No. 2, 209--212 (2000; Zbl 0952.03030) Full Text: DOI
Tammet, Tanel; Smith, Jan M. Optimized econdings of fragments of type theory in first-order logic. (English) Zbl 0926.03009 J. Log. Comput. 8, No. 6, 713-744 (1998). Reviewer: M.P.Bonacina (Iowa City) MSC: 03B35 03B15 68T27 PDFBibTeX XMLCite \textit{T. Tammet} and \textit{J. M. Smith}, J. Log. Comput. 8, No. 6, 713--744 (1998; Zbl 0926.03009) Full Text: DOI
van Benthem, Johan; D’Agostino, Giovanna; Montanari, Angelo; Policriti, Alberto Modal deduction in second-order logic and set theory. I. (English) Zbl 0873.03021 J. Log. Comput. 7, No. 2, 251-265 (1997). MSC: 03B45 PDFBibTeX XMLCite \textit{J. van Benthem} et al., J. Log. Comput. 7, No. 2, 251--265 (1997; Zbl 0873.03021) Full Text: DOI
Nurmonen, Juha On winning strategies with unary quantifiers. (English) Zbl 0869.03020 J. Log. Comput. 6, No. 6, 779-798 (1996). Reviewer: J.Flum (Freiburg i.Br.) MSC: 03C13 03C80 05C40 PDFBibTeX XMLCite \textit{J. Nurmonen}, J. Log. Comput. 6, No. 6, 779--798 (1996; Zbl 0869.03020) Full Text: DOI Link
Martí-Oliet, Narciso; Meseguer, José Inclusions and subtypes. I: First-order case. (English) Zbl 0931.03048 J. Log. Comput. 6, No. 3, 409-438 (1996). MSC: 03B70 03G30 68Q55 PDFBibTeX XMLCite \textit{N. Martí-Oliet} and \textit{J. Meseguer}, J. Log. Comput. 6, No. 3, 409--438 (1996; Zbl 0931.03048) Full Text: DOI Link
Bonatti, Piero A. A three-valued formalization of provability. (English) Zbl 0820.03035 J. Log. Comput. 5, No. 2, 173-201 (1995). Reviewer: A.Nabebin (Moskva) MSC: 03F03 03B60 68N17 03B70 PDFBibTeX XMLCite \textit{P. A. Bonatti}, J. Log. Comput. 5, No. 2, 173--201 (1995; Zbl 0820.03035) Full Text: DOI
Bachmair, Leo; Ganzinger, Harald Rewrite-based equational theorem proving with selection and simplification. (English) Zbl 0814.68117 J. Log. Comput. 4, No. 3, 217-247 (1994). Reviewer: M.Armbrust (Köln) MSC: 68T15 03B35 03B10 68Q42 PDFBibTeX XMLCite \textit{L. Bachmair} and \textit{H. Ganzinger}, J. Log. Comput. 4, No. 3, 217--247 (1994; Zbl 0814.68117) Full Text: DOI Link
Bertossi, Leopoldo E. Circumscription in data logic for data type specification. (English) Zbl 0802.68082 J. Log. Comput. 4, No. 1, 89-96 (1994). MSC: 68Q65 03B80 68T35 68T27 68P05 PDFBibTeX XMLCite \textit{L. E. Bertossi}, J. Log. Comput. 4, No. 1, 89--96 (1994; Zbl 0802.68082) Full Text: DOI Link
Szalas, Andrzej On the correspondence between modal and classical logic: An automated approach. (English) Zbl 0802.03009 J. Log. Comput. 3, No. 6, 605-620 (1993). Reviewer: C.Masalagiu (Iaşi) MSC: 03B35 03B45 03B10 PDFBibTeX XMLCite \textit{A. Szalas}, J. Log. Comput. 3, No. 6, 605--620 (1993; Zbl 0802.03009) Full Text: DOI Link
Davis, Martin; Fechter, Ronald A free variable version of the first-order predicate calculus. (English) Zbl 0754.03004 J. Log. Comput. 1, No. 4, 431-451 (1991). Reviewer: P.-G.Holban (Iaşi) MSC: 03B10 03B35 68T15 PDFBibTeX XMLCite \textit{M. Davis} and \textit{R. Fechter}, J. Log. Comput. 1, No. 4, 431--451 (1991; Zbl 0754.03004) Full Text: DOI