Showing 1 - 20 of 1,753

1

Between Burgess and Lewis – Part I: Logics without Rational Monotonicity: Between burgess and Lewis. I: Logics without rational monotonicity
Eric Raidl
Journal of Philosophical Logic. 54:291-327

Measurement theory in th... disjunctive rationality Other model construction... decidability Linguistics General logic
Academic journal
Save to List
2

The Topological Mu-Calculus: completeness and decidability: The topological mu-calculus: completeness and decidability
Alexandru Baltag ; Nick Bezhanishvili ; David Fernández-Duque
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). :1-13

FOS: Computer and inform... Computer Science - Logic... fixpoint logic decidability 02 engineering and techn... 01 natural sciences
Academic journal
Save to List
3

Analyzing ultimate positivity for solvable systems
Ming Xu ; Zhenbing Zeng ; Zhibin Li ; et al.
Theoretical Computer Science. 609:395-412

Decidability of theories... positivity problem number theory Word problems, other dec... 0102 computer and inform... Generic properties, stru...
Academic journal
Save to List
4

DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS: Decidability and complexity in automatic monoids.
Markus Lohrey
Lecture Notes in Computer Science ISBN: 9783540240143

automatic monoids word problem Free semigroups, generat... 4. Education Word problems, other dec... 0102 computer and inform...
Academic journal
Save to List
5

Comparing the succinctness of monadic query languages over finite trees
Martin Grohe ; Nicole Schweikardt
Lecture Notes in Computer Science ISBN: 9783540408017

monadic datalog full modal mu-calculus 4. Education Database theory monadic second-order log... Model theory of finite s...
Academic journal
Save to List
6

Working with arms: Complexity results on atomic representations of Herbrand models: Working with ARMs: Complexity results on atomic representations of Herbrand models
Gottlob, G ; Pichler, R
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158). :306-315

computational complexity coNP-complete problems atomic representation Herbrand model 0102 computer and inform... 02 engineering and techn...
Academic journal
Save to List
7

The finite graph problem for two-way alternating automata: The finite graph problem for two-way alternating automata.
Mikołaj Bojańczyk
Lecture Notes in Computer Science ISBN: 9783540418641

\(\mu\)-calculus Decidability of theories... Alternating automata Formal languages and aut... 0102 computer and inform... 0101 mathematics
Academic journal
Save to List
8

The Monadic Theory of Morphic Infinite Words and Generalizations: The monadic theory of morphic infinite words and generalizations
Wolfgang Thomas ; Olivier Carton
Lecture Notes in Computer Science ISBN: 9783540679011

Decidability of theories... Computational Theory and... Semigroups in automata t... Formal languages and aut... 0102 computer and inform... 0101 mathematics
Book
Save to List
9

Solvability of Context Equations with Two Context Variables Is Decidable: Solvability of context equations with two context variables is decidable
Manfred Schmidt-Schauß ; Klaus U. Schulz
Lecture Notes in Computer Science ISBN: 9783540662228

Mechanization of proofs... Computational Mathematic... Decidability of theories... Algebra and Number Theor... context unification 0102 computer and inform...
Book
Save to List
10

Taming first-order logic
Mikulas, S. ; Trautwein, M. ; Fischer, S.
Logic Journal of IGPL. 6:305-316

Decidability of theories... 4. Education decidability Classical first-order lo... fragments of first-order... 0102 computer and inform...
Academic journal
Save to List
11

Deciding Global Partial-Order Properties: Deciding global partial-order properties
Kenneth L. McMillan ; Doron Peled ; Rajeev Alur
Lecture Notes in Computer Science ISBN: 9783540647812

Specification and verifi... Decidability of theories... 0202 electrical engineer... Temporal logic 0102 computer and inform... 02 engineering and techn...
Academic journal
Save to List
12

Modal Foundations for Predicate Logic: Modal foundations for predicate logic
van Benthem, J.F.A.K.
Logic Journal of IGPL. 5:259-286

modalities predicate logic decidable sublogics first-order quantifiers Classical first-order lo... 06 humanities and the ar...
Academic journal
Save to List
13

Undecidability results on two-variable logics
Martin Otto ; Eric Rosen ; Erich Grädel
Lecture Notes in Computer Science ISBN: 9783540626169

monadic fixed-point oper... satisfiability in finite... Decidability of theories... weak access to cardinali... satisfiability undecidability
Book
Save to List
14

Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages: Complexity assessments for decidable fragments of set theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages
Cantone, Domenico ; Maugeri, Pietro ; Omodeo, Eugenio G. ; et al.
Theoretical Computer Science. 954:113786

expressibility Analysis of algorithms a... satisfiability problem Computable set theory computable set theory 0102 computer and inform...
Academic journal
Save to List
15

Building Decision Procedures for Modal Logics from Propositional Decision Procedures: The Case Study of Modal K(m): Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\).
Giunchiglia, Fausto ; Sebastiani, Roberto ; Giunchiglia, Fausto ; et al.
Lecture Notes in Computer Science ISBN: 9783540615118

decision procedures 02 engineering and techn... Theoretical Computer Sci... Computer Science Applica... Mechanization of proofs... Decidability of theories...
Academic journal
Save to List
16

Monadic second-order logic on tree-like structures
Igor Walukiewicz
Lecture Notes in Computer Science ISBN: 9783540609223

monadic second-order log... decidability Decidability Formal languages and aut... 0102 computer and inform... Automata and formal gram...
Academic journal
Save to List
17

A new decidable Horn fragment of predicate calculus
V. P. Orevkov
Journal of Mathematical Sciences. 134:2403-2410

Complexity of computatio... Decidability of theories... decidability Complexity classes (hier... predicate calculus 0102 computer and inform...
Academic journal
Save to List
18

A Decision Method for Nonmonotonic Reasoning Based on Autoepistemic Reasoning: A decision method for nonmonotonic reasoning based on autoepistemic reasoning
Niemelä Ilkka
Principles of Knowledge Representation and Reasoning ISBN: 9781483214528

Analysis of algorithms a... 4. Education nonmonotonic logic 0102 computer and inform... 02 engineering and techn... Other nonclassical logic
Book
Save to List
19

First-order definitions of rational functions and S-integers over holomorphy rings of algebraic functions of characteristic 0: First-order definitions of rational functions and \({\mathcal S}\)-integers over holomorphy rings of algebraic functions of characteristic 0
Alexandra Shlapentokh
Annals of Pure and Applied Logic. 136:267-283

Decidability of theories... First-order undecidabili... 4. Education Model-theoretic algebra First-order definability 0101 mathematics
Academic journal
Save to List
20

Diophantine definability of infinite discrete nonarchimedean sets and Diophantine models over large subrings of number fields: Diophantine definability of infinite discrete nonarchimedean sets and Diophantine models over large subrings of number field
Bjorn Poonen ; Alexandra Shlapentokh
Journal für die reine und angewandte Mathematik (Crelles Journal). 2005:27-47

Decidability (number-the... 11U05, 11G05 Mathematics - Number The... Mathematics - Logic Interpolation, preservat... 01 natural sciences
Academic journal
Save to List

Filter