Search Results - ((abstract OR abstracts) OR abstracts) and automation computability and recursion theory*

A Rice’s Theorem for Abstract Semantics

Authors: Baldan, Paolo Ranzato, Francesco Zhang, Linpeng et al.

Contributors: Baldan, Paolo Ranzato, Francesco Zhang, Linpeng et al.

Subject Terms: Computability Theory, Recursive Function, Rice’s Theorem, Kleene’s Second Recursion Theorem, Program Analysis, Affine Program Invariants

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.117

Availability: https://doi.org/10.4230/LIPIcs.ICALP.2021.117
https://nbn-resolving.org/urn:nbn:de:0030-drops-141860
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.117

Intensional Kleene and Rice theorems for abstract program semantics

Authors: Paolo Baldan Francesco Ranzato Linpeng Zhang

Source: Information and Computation. 289:104953

Subject Terms: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, F.1.1, F.3.1, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Logic in Computer Science (cs.LO)

Access URL: http://arxiv.org/abs/2105.14579

Intensional Kleene and Rice Theorems for Abstract Program Semantics

Authors: Baldan, Paolo Ranzato, Francesco Zhang, Linpeng

Index Terms: Computer Science - Logic in Computer Science, Computer Science - Formal Languages and Automata Theory, F.1.1, F.3.1, text

URL: http://arxiv.org/abs/2105.14579

REDUCIBILITY IN SOME CATEGORIES OF PARTIAL RECURSIVE OPERATORS: Reducibility in some categories of partial recursive operators

Authors: Caterina Bianchini Andrea Sorbi Sorbi, Andrea

Contributors: Caterina Bianchini Andrea Sorbi Sorbi, Andrea

Source: Mathematical Logic Quarterly. 38:349-359

Subject Terms: Categories of machines, automata, partial recursive operators, reducibility, 01 natural sciences, partial recursive operator, dominical categories, Recursion categories, recursion categories, completeness, dominical categorie, creativeness, 0101 mathematics, Abstract and axiomatic computability and recursion theory, Theory of numerations, effectively presented structures, domains

File Description: application/xml; application/pdf; STAMPA

Access URL: https://zbmath.org/584617
https://doi.org/10.1002/malq.19920380133
https://onlinelibrary.wiley.com/doi/abs/10.1002/malq.19920380133
https://philpapers.org/rec/BIARIS
https://hdl.handle.net/11365/1082757
https://doi.org/10.1002/malq.19920380133

On Strong and Weak Logics for Paraconsistent Computability.

Authors: Weber, Zach Cano-Jorge, Fernando

Source: Journal of Applied Logics- IfCoLog Journal of Logics & their Applications (FLAP); Jun2025, Vol. 12 Issue 5, p1349-1381, 33p

Subject Terms: RECURSION theory, ARITHMETIC, LOGIC, MATHEMATICS, VIRTUES

Two new proof techniques for investigating the computational power of two-way computing devices. (Abstract of thesis)

Authors: Ďuriš, P.

Subject Terms: two-way deterministic pushdown automata, Complexity of computation (including implicit computational complexity), Turing machines with two read heads, two-way deterministic counter automata, Analysis of algorithms and problem complexity, Formal languages and automata, Models of computation (Turing machines, etc.), Computability and recursion theory on ordinals, admissible sets, etc

File Description: application/xml

Access URL: https://zbmath.org/4117867

On Signifiable Computability: Part II: An Axiomatization of Signifiable Computation and Debugger Theorems.

Authors: Kulyukin, Vladimir A.

Source: Mathematics (2227-7390); Mar2025, Vol. 13 Issue 6, p934, 36p

Subject Terms: RECURSION theory, REAL numbers, COMPUTABLE functions, NUMBER theory, DATA structures

Abstract geometrical computation 12: generating representation of infinite countable linear orderings.

Authors: Durand-Lose, Jérôme

Source: Natural Computing; Mar2025, Vol. 24 Issue 1, p67-78, 12p

Subject Terms: LINEAR orderings, TURING machines, REAL numbers, MACHINERY

A glimpse into the paradise of combinatory algebra

Authors: W. Richard Stark

Source: International Journal of Computer & Information Sciences. 13:219-236

Subject Terms: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations, combinatory algebra, Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science, fixed points, type-free lambda-calculus, functional programming, Formal languages and automata, 02 engineering and technology, Automata and formal grammars in connection with logical questions, 01 natural sciences, Computability and recursion theory on ordinals, admissible sets, etc, foundations of computability theory, 0202 electrical engineering, electronic engineering, information engineering, Combinatory logic and lambda calculus, finite state automaton, 0101 mathematics, Abstract data types, algebraic specification

File Description: application/xml

Access URL: https://dblp.uni-trier.de/db/journals/ijpp/ijpp13.html#Stark84
https://link.springer.com/article/10.1007/BF00979873
https://link.springer.com/content/pdf/10.1007/BF00979873.pdf

Towards a Logical Foundation of Randomized Computation: Doctoral Thesis Abstract.

Authors: Antonelli, Melissa

Source: KI: Künstliche Intelligenz; Aug2024, Vol. 38 Issue 1/2, p99-105, 7p

A ROBUST GRAPH-BASED APPROACH TO OBSERVATIONAL EQUIVALENCE.

Authors: GHICA, DAN R. KOKO MUROYA WAUGH AMBRIDGE, TODD

Source: Logical Methods in Computer Science (LMCS); 2025, Vol. 21 Issue 2, p1-95, 95p

Subject Terms: MACHINE theory, NEIGHBORHOODS, GEOMETRY, MACHINERY

Cancellation rules and extended word problems

Authors: Friedrich Otto Ronald V. Book

Source: Information Processing Letters. 20:5-11

Subject Terms: Communication, information, congruences, Church-Rosser property, cancellation rules, Formal languages and automata, security, two-party protocols, 0102 computer and information sciences, 02 engineering and technology, Thue and Post systems, etc, 01 natural sciences, extended word problem, polynomial-time algorithms, nondeterministic finite state acceptor, 0202 electrical engineering, electronic engineering, information engineering, Thue systems, Word problems, etc. in computability and recursion theory, Abstract data types, algebraic specification

File Description: application/xml

Access URL: https://www.sciencedirect.com/science/article/pii/002001908590122X
https://dblp.uni-trier.de/db/journals/ipl/ipl20.html#BookO85
https://doi.org/10.1016/0020-0190(85)90122-X

Confluent and Other Types of Thue Systems: Confluent and other types of Thue systems

Authors: Ronald V. Book

Source: Journal of the ACM. 29:171-182

Subject Terms: Church-Rosser system, confluent systems, Formal languages and automata, 0102 computer and information sciences, Thue and Post systems, etc, preperfect system, deterministic context-free language, 01 natural sciences, word problems, Thue congruence, Decidability of theories and sets of sentences, 0101 mathematics, Word problems, etc. in computability and recursion theory, Abstract data types, algebraic specification

File Description: application/xml

Access URL: https://dblp.uni-trier.de/db/journals/jacm/jacm29.html#Book82
https://doi.acm.org/10.1145/322290.322301
https://dl.acm.org/doi/10.1145/322290.322301

Recursivite et cones rationnels fermes par intersection: Recursivite et cônes rationnels fermés par intersection

Authors: M. Latteux A. Arnold

Source: Calcolo. 15:381-394

Subject Terms: semi-Dyck language, decidability, 0202 electrical engineering, electronic engineering, information engineering, quasi-commutative grammars, Formal languages and automata, 0102 computer and information sciences, 02 engineering and technology, abstract families of languages, rational cones, recursive languages, Word problems, etc. in computability and recursion theory, reachability problem in vector-addition systems, 01 natural sciences

File Description: application/xml

Access URL: https://link.springer.com/content/pdf/10.1007/BF02576519.pdf
https://link.springer.com/article/10.1007/BF02576519

Degrees of automata transformations

Authors: Bajrasheva, V. R.

Subject Terms: category methods in recursion theory, Other degrees and reducibilities in computability and recursion theory, Formal languages and automata, Automata and formal grammars in connection with logical questions, Abstract and axiomatic computability and recursion theory, complete degrees

File Description: application/xml

Access URL: https://zbmath.org/3904569

Countability constraints in order-theoretic approaches to computability.

Source: Mathematical Structures in Computer Science; Jun2024, Vol. 34 Issue 6, p1-38, 38p

Subject Terms: TURING machines, RECURSION theory, DENSITY, MACHINERY

Mathematical Logic: Proof Theory, Constructive Mathematics (hybrid meeting).

Source: Oberwolfach Reports; 2021, p1693-1757, 65p

Subject Terms: MATHEMATICAL logic, ABSTRACT algebra, PROOF theory, LOGIC, COMPUTATIONAL mechanics

History of Abstract Interpretation.

Authors: Giacobazzi, Roberto Ranzato, Francesco

Source: IEEE Annals of the History of Computing; Apr-Jun2022, Vol. 44 Issue 2, p33-43, 11p

Subject Terms: PROGRAMMING languages, MATHEMATICAL models

ABSTRACTS from other ACM Publications.

Source: Communications of the ACM; Jul1982, Vol. 25 Issue 7, p487-492, 6p

Subject Terms: SEQUENTIAL machine theory, REDUCED instruction set computers, MICROELECTRONICS, INTEGRATED circuits

Reviews & Products: COMMUNICATIONS of the ACM (Periodical)

Research on a General State Formalization Method from the Perspective of Logic.

Authors: Qiu, Siyuan Xu, Jianfeng

Source: Mathematics (2227-7390); Oct2025, Vol. 13 Issue 20, p3324, 36p

Subject Terms: MODEL theory, INFORMATION theory, SEMANTICS, MATHEMATICAL logic