## Found 1,257 Documents (Results 1–100)

100
MathJax

### The Caucal hierarchy: interpretations in the (W)MSO+$$\mathsf{U}$$ logic. (English)Zbl 07540271

MSC:  03B25 03D05
Full Text:

Full Text:

### Entailment is undecidable for symbolic heap separation logic formulæ with non-established inductive rules. (English)Zbl 07411507

MSC:  03B70 03B25 03B35
Full Text:

### Certifying proofs in the first-order theory of rewriting. (English)Zbl 1474.68166

Groote, Jan Friso (ed.) et al., Tools and algorithms for the construction and analysis of systems. 27th international conference, TACAS 2021, held as part of the European joint conferences on theory and practice of software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 12652, 127-144 (2021).
Full Text:

### On the expressiveness of Büchi arithmetic. (English)Zbl 07410431

Kiefer, Stefan (ed.) et al., Foundations of software science and computation structures. 24th international conference, FOSSACS 2021, held as part of the European joint conferences on theory and practice of software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12650, 310-323 (2021).
MSC:  68Nxx 68Qxx
Full Text:

Full Text:

Full Text:

Full Text:

### Automatic structures: twenty years later. (English)Zbl 07299455

Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 21-34 (2020).
MSC:  03D05 68Q45
Full Text:

Full Text:

### Pebble-intervals automata and $$\text{FO}^2$$ with two orders. (English)Zbl 1437.68100

Leporati, Alberto (ed.) et al., Language and automata theory and applications. 14th international conference, LATA 2020, Milan, Italy, March 4–6, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12038, 208-221 (2020).
Full Text:

### Recompression: technique for word equations and compressed data. (English)Zbl 1437.68098

Leporati, Alberto (ed.) et al., Language and automata theory and applications. 14th international conference, LATA 2020, Milan, Italy, March 4–6, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12038, 44-67 (2020).
Full Text:

Full Text:

### Definability in first-order theories of graph orderings. (English)Zbl 1476.03039

MSC:  03C13 03C40 03C65
Full Text:

Full Text:

### Logic and rational languages of scattered and countable series-parallel posets. (English)Zbl 1453.03037

MSC:  03D05 03B25 68Q45
Full Text:

Full Text:

### Formal logic. Classical problems and proofs. (English)Zbl 1451.03001

Studies in Logic (London) 82. London: College Publications (ISBN 978-1-84890-317-3). xix, 404 p. (2019).

Full Text:

Full Text:

### On the foundations of finitely supported sets. (English)Zbl 1429.03157

MSC:  03E70 03E25
Full Text:

### On the nature of discrete space-time. I. The distance formula, relativistic time dilation and length contradiction in discrete space-time. (English)Zbl 1434.83096

MSC:  83D05 83C27 83A05
Full Text:

### A tale of two set theories. (English)Zbl 1428.68348

Kaliszyk, Cezary (ed.) et al., Intelligent computer mathematics. 12th international conference, CICM 2019, Prague, Czech Republic, July 8–12, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11617, 44-60 (2019).
Full Text:

### Logic and rational languages of scattered and countable series-parallel posets. (English)Zbl 1425.03013

Martín-Vide, Carlos (ed.) et al., Language and automata theory and applications. 13th international conference, LATA 2019, St. Petersburg, Russia, March 26–29, 2019, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11417, 275-287 (2019).
MSC:  03D05 03B25
Full Text:

### Going higher in first-order quantifier alternation hierarchies on words. (English)Zbl 1427.03050

MSC:  03D05 03B25 03C13
Full Text:

### On decidability of list structures. (English. Russian original)Zbl 1481.03029

Sib. Math. J. 60, No. 3, 377-388 (2019); translation from Sib. Mat. Zh. 60, No. 3, 489-505 (2019).
Full Text:

Full Text:

Full Text:

Full Text:

### The logical strength of Büchi’s decidability theorem. (English)Zbl 07058775

MSC:  03D05 03B25 03F35
Full Text:

### Nested antichains for WS1S. (English)Zbl 1417.68182

MSC:  68T15 03B25 03B35 03D05
Full Text:

Full Text:

### Formalization of the arithmetization of Euclidean plane geometry and applications. (English)Zbl 1394.68349

MSC:  68T15 03B30 03B35 51M04 68W30
Full Text:

### Recursion schemes and the WMSO+U logic. (English)Zbl 1491.03010

Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 53, 16 p. (2018).
MSC:  03B25 03D05 03B40
Full Text:

### Revisiting MITL to fix decision procedures. (English)Zbl 1446.68099

Dillig, Isil (ed.) et al., Verification, model checking, and abstract interpretation. 19th international conference, VMCAI 2018, Los Angeles, CA, USA, January 7–9, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10747, 474-494 (2018).
Full Text:

### Linear temporal logic with non-transitive time, algorithms for decidability and verification of admissibility. (English)Zbl 1429.03074

Odintsov, Sergei (ed.), Larisa Maksimova on implication, interpolation, and definability. Cham: Springer. Outst. Contrib. Log. 15, 219-243 (2018).
MSC:  03B44 03B25 03B47
Full Text:

### Model-theoretic conservative extension for definitional theories. (English)Zbl 1434.03028

Alves, Sandra (ed.) et al., Selected papers of the 12th workshop on logical and semantic frameworks, with applications (LSFA 2017), Brasilia, Brazil, September 23–24, 2017. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 338, 133-145 (2018).
Full Text:

Full Text:

### Decidable inequalities over infinite trees. (English)Zbl 1415.68059

Barthe, Gilles (ed.) et al., LPAR-22. 22nd international conference on logic for programming, artificial intelligence and reasoning, Awassa, Ethiopia, November 17–21, 2018. Selected papers. Manchester: EasyChair. EPiC Ser. Comput. 57, 111-130 (2018).
Full Text:

### Logic, unity in three persons. (Russian. English summary)Zbl 1431.03077

MSC:  03G10 03B22
Full Text:

Full Text:

### Constructive decision via redundancy-free proof-search. (English)Zbl 1468.03014

Galmiche, Didier (ed.) et al., Automated reasoning. 9th international joint conference, IJCAR 2018, held as part of the federated logic conference, FloC 2018, Oxford, UK, July 14–17, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10900, 422-438 (2018).
Full Text:

### Introduction to stochastic finance: random variables and arbitrage theory. (English)Zbl 1401.91584

MSC:  91G80 03B35
Full Text:

Full Text:

Full Text:

Full Text:

### An introduction to the technique of formative processes in set theory. (English)Zbl 1402.03004

Cham: Springer (ISBN 978-3-319-74777-4/hbk; 978-3-319-74778-1/ebook). xii, 154 p. (2018).
Full Text:

Full Text:

### Level two of the quantifier alternation hierarchy over infinite words. (English)Zbl 1436.03216

MSC:  03D05 03B25 03C13
Full Text:

### On the costs of nonclassical logic. (English)Zbl 1436.03167

MSC:  03B60 03A05
Full Text:

Full Text:

### Many-sorted equivalence of shiny and strongly polite theories. (English)Zbl 1425.68370

MSC:  68T15 03B35 68T20
Full Text:

### Decidability, complexity, and expressiveness of first-order logic over the subword ordering. (English)Zbl 1452.03028

Proceedings of the 2017 32nd annual ACM/IEEE symposium on logic in computer science, LICS 2017, Reykjavík University, Reykjavík, Iceland, June 20–23, 2017. Piscataway, NJ: IEEE Press. Article No. 81, 12 p. (2017).
Full Text:

### Separation for dot-depth two. (English)Zbl 1457.68146

Proceedings of the 2017 32nd annual ACM/IEEE symposium on logic in computer science, LICS 2017, Reykjavík University, Reykjavík, Iceland, June 20–23, 2017. Piscataway, NJ: IEEE Press. Article No. 10, 12 p. (2017).
Full Text:

### Logic and regular cost functions. (English)Zbl 1452.03089

Proceedings of the 2017 32nd annual ACM/IEEE symposium on logic in computer science, LICS 2017, Reykjavík University, Reykjavík, Iceland, June 20–23, 2017. Piscataway, NJ: IEEE Press. Article No. 1, 4 p. (2017).
Full Text:

### Lazy automata techniques for WS1S. (English)Zbl 1452.03090

Legay, Axel (ed.) et al., Tools and algorithms for the construction and analysis of systems. 23rd international conference, TACAS 2017, held as part of the European joint conferences on theory and practice of software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 10205, 407-425 (2017).
MSC:  03D05 03B25 68Q45
Full Text:

### Characterizing definability in decidable fixpoint logics. (English)Zbl 1442.03012

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 107, 14 p. (2017).
MSC:  03B70 03B25 03D05
Full Text:

### Emptiness of zero automata is decidable. (English)Zbl 1442.68084

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 106, 13 p. (2017).
MSC:  68Q45 03B25 03D05
Full Text:

### Nested multisets, hereditary multisets, and syntactic ordinals in Isabelle/HOL. (English)Zbl 1434.03025

Miller, Dale (ed.), 2nd international conference on formal structures for computation and deduction. FSCD 2017, Oxford, UK, September 3–9, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 84, Article 11, 18 p. (2017).
MSC:  03B35 03B25 03F15
Full Text:

### Logical anti-exceptionalism and theoretical equivalence. (English)Zbl 1402.03018

Analysis, Oxf. 77, No. 4, 759-767 (2017); corrigendum ibid. 77, No. 4, 768 (2017).
MSC:  03A05
Full Text:

### Introduction to stopping time in stochastic finance theory. II. (English)Zbl 1401.60071

MSC:  60G40 91G80 03B35
Full Text:

### Monadic decomposition. (English)Zbl 1426.03026

MSC:  03D05 03B25
Full Text:

### On the strength of some topological lattices. (English)Zbl 1437.03133

Broglia, Fabrizio (ed.) et al., Ordered algebraic structures and related topics. International conference at CIRM, Luminy, France, October 12–16, 2015. Proceedings. Providence, RI: American Mathematical Society (AMS). Contemp. Math. 697, 325-347 (2017).
Full Text:

Full Text:

Full Text:

Full Text:

### Categoricity results for second-order ZF in dependent type theory. (English)Zbl 1468.03012

Ayala-Rincón, Mauricio (ed.) et al., Interactive theorem proving. 8th international conference, ITP 2017, Brasília, Brazil, September 26–29, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10499, 304-318 (2017).
Full Text:

### Some observations on the logical foundations of inductive theorem proving. (English)Zbl 1460.03005

MSC:  03B35 03C62 03F05
Full Text:

Full Text:

### Monadic second-order logic on finite sequences. (English)Zbl 1387.03006

Castagna, Giuseppe (ed.) et al., Proceedings of the 44th annual ACM SIGPLAN symposium on principles of programming languages, POPL ’17, Paris, France, January 15–21, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4660-3). 232-245 (2017).
MSC:  03B25 03B15 03D05 68T15
Full Text:

### Connecting decidability and complexity for MSO logic. (English)Zbl 06791067

Charlier, Émilie (ed.) et al., Developments in language theory. 21st international conference, DLT 2017, Liège, Belgium, August 7–11, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10396, 75-79 (2017).
Full Text:

Full Text:

### Introduction to stopping time in stochastic finance theory. (English)Zbl 1377.60055

MSC:  60G40 91G80 03B35
Full Text:

### Decidability of the monadic shallow linear first-order fragment with straight dismatching constraints. (English)Zbl 1468.03006

de Moura, Leonardo (ed.), Automated deduction – CADE 26. 26th international conference on automated deduction, Gothenburg, Sweden, August 6–11, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10395, 202-219 (2017).
MSC:  03B25 03B20 03B35
Full Text:

### On the combination of the Bernays-Schönfinkel-Ramsey fragment with simple linear integer arithmetic. (English)Zbl 06778398

de Moura, Leonardo (ed.), Automated deduction – CADE 26. 26th international conference on automated deduction, Gothenburg, Sweden, August 6–11, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10395, 77-94 (2017).
MSC:  03B35 03B25 03B62
Full Text:

### The determinacy strength of pushdown $$\omega$$-languages. (English)Zbl 1420.03089

MSC:  03D05 03B30 68Q45
Full Text:

Full Text:

Full Text:

Full Text:

### BDI: a new decidable clause class. (English)Zbl 1444.03015

MSC:  03B35 03B25 03B10
Full Text:

### Boolean unification with predicates. (English)Zbl 1407.68217

MSC:  68Q25 03B10 03B25 03B35 03C10 68T15
Full Text:

Full Text:

### Tensor product of no-signaling boxes in the framework of quantum logics. (English)Zbl 1357.81069

MSC:  81P68 81P10 94A12
Full Text:

### Discrete causal theory. Emergent spacetime and the causal metric hypothesis. (English)Zbl 1360.81001

Cham: Springer (ISBN 978-3-319-50081-2/hbk; 978-3-319-50083-6/ebook). xxx, 558 p. (2017).
MSC:  81-02 83D05 81P10
Full Text:

Full Text:

### Wedge sum, merge and inconsistency. (English)Zbl 1439.03065

Bimbó, Katalin (ed.), J. Michael Dunn on information based logics. Cham: Springer. Outst. Contrib. Log. 8, 45-51 (2016).
MSC:  03B53
Full Text:

### A step up in expressiveness of decidable fixpoint logics. (English)Zbl 1394.03014

Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 817-826 (2016).
Full Text:

### How unprovable is Rabin’s decidability theorem? (English)Zbl 1394.03016

Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 788-797 (2016).
Full Text:

### Automata on infinite trees with equality and disequality constraints between siblings. (English)Zbl 1401.68152

Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 227-236 (2016).
MSC:  68Q45 03B25 03D05
Full Text:

### Deciding first-order satisfiability when universal and existential variables are separated. (English)Zbl 1394.03013

Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 86-95 (2016).
Full Text:

### Decidability and complexity of tree share formulas. (English)Zbl 1391.68019

Lal, Akash (ed.) et al., 36th IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2016), Chennai, India, December 13–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-027-9). LIPIcs – Leibniz International Proceedings in Informatics 65, Article 19, 14 p. (2016).
Full Text:

### Model checking flat freeze LTL on one-counter automata. (English)Zbl 1392.68257

Desharnais, Josée (ed.) et al., 27th international conference on concurrency theory, CONCUR 2016, Québec City, Canada, August 23–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-017-0). LIPIcs – Leibniz International Proceedings in Informatics 59, Article 29, 14 p. (2016).
Full Text:

Full Text:

### Recognizable sets of power series over finite fields. (Ensembles reconnaissables de séries formelles sur un corps fini.) (French. English summary)Zbl 1387.03035

MSC:  03D05 03B25
Full Text:

### The MSO+U theory of $$(\mathbb N,<)$$ is undecidable. (English)Zbl 1388.03016

Ollinger, Nicolas (ed.) et al., 33rd symposium on theoretical aspects of computer science, STACS 2016, Orléans, France, February 17–20, 2016. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-001-9). LIPIcs – Leibniz International Proceedings in Informatics 47, Article 21, 8 p. (2016).
MSC:  03B25 03D05 03B15
Full Text:

### Quasi-decidability of a fragment of the first-order theory of real numbers. (English)Zbl 1437.03047

MSC:  03B25 03B35 03D78
Full Text:

### Definability in first order theories of graph orderings. (English)Zbl 1476.03040

Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4–7, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9537, 331-348 (2016).
MSC:  03C13 03C40 03C65
Full Text:

### The logical strength of Büchi’s decidability theorem. (English)Zbl 1370.03058

Regnier, Laurent (ed.) et al., 25th EACSL annual conference and 30th workshop on computer science logic, CSL’16, Marseille, France, August 29 – September 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-022-4). LIPIcs – Leibniz International Proceedings in Informatics 62, Article 36, 16 p. (2016).
MSC:  03D05 03B25 03F35
Full Text:

Full Text:

Full Text:

all top 5

all top 5

all top 5

all top 3

all top 3

all top 3