Relevant bibliographies by topics / Axiomatizability

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Axiomatizability'

Author: Grafiati
Published: 4 June 2021
Last updated: 11 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Axiomatizability.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Axiomatizability"

1

Roşu, Grigore. "Equational axiomatizability for coalgebra." Theoretical Computer Science 260, no. 1-2 (2001): 229–47. http://dx.doi.org/10.1016/s0304-3975(00)00129-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

ROŞU, GRIGORE. "Axiomatizability in inclusive equational logics." Mathematical Structures in Computer Science 12, no. 5 (2002): 541–63. http://dx.doi.org/10.1017/s0960129501003474.

Full text
Abstract:
A categorical framework for equational logics is presented, together with axiomatizability results in the style of Birkhoff. The distinctive categorical structures used are inclusion systems, which are an alternative to factorization systems in which factorization is required to be unique rather than unique ‘up to an isomorphism’. In this framework, models are any objects, and equations are special epimorphisms in [Cfr ], while satisfaction is injectivity. A first result says that equations-as-epimorphisms define exactly the quasi-varieties, suggesting that epimorphisms actually represent cond
APA, Harvard, Vancouver, ISO, and other styles
3

Sinclair, Peter. "Computable axiomatizability of elementary classes." Mathematical Logic Quarterly 62, no. 1-2 (2016): 46–51. http://dx.doi.org/10.1002/malq.201400110.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Osherson, Daniel N., and Scott Weinstein. "Finite Axiomatizability and Scientific Discovery." PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988, no. 2 (1988): 409–12. http://dx.doi.org/10.1086/psaprocbienmeetp.1988.2.192901.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

TITIEV, ROBERT J. "Multidimensional measurement and universal axiomatizability." Theoria 38, no. 1-2 (2008): 82–88. http://dx.doi.org/10.1111/j.1755-2567.1972.tb00925.x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Campercholi, Miguel, and Diego Vaggione. "Axiomatizability by $${{\forall}{\exists}!}$$ -sentences." Archive for Mathematical Logic 50, no. 7-8 (2011): 713–25. http://dx.doi.org/10.1007/s00153-011-0244-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mundici, Daniele. "Finite axiomatizability in Łukasiewicz logic." Annals of Pure and Applied Logic 162, no. 12 (2011): 1035–47. http://dx.doi.org/10.1016/j.apal.2011.06.026.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Tokarz, Marek. "Non-axiomatizability of Grice's implicature." Studia Logica 53, no. 2 (1994): 343–49. http://dx.doi.org/10.1007/bf01054716.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Clark, D. M., B. A. Davey, M. G. Jackson, and J. G. Pitkethly. "The axiomatizability of topological prevarieties." Advances in Mathematics 218, no. 5 (2008): 1604–53. http://dx.doi.org/10.1016/j.aim.2008.03.020.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pervukhin, M. A., and A. A. Stepanova. "Axiomatizability of free S-posets." Journal of Mathematical Sciences 166, no. 6 (2010): 756–66. http://dx.doi.org/10.1007/s10958-010-9891-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Axiomatizability"

1

Bauer, Sebastian. "Algorithmische Eigenschaften von Branching-Time Logiken." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2007. http://nbn-resolving.de/urn:nbn:de:swb:14-1168770883767-64981.

Full text
Abstract:
Es wird die Axiomatisierbarkeit einer Klasse von temporalen Prädikatenlogiken über verzweigenden Strukturen gezeigt. Entscheidbarkeitsresultate folgen für diverse Fragmente dieser Logiken. Anwendungen werden diskutiert.
APA, Harvard, Vancouver, ISO, and other styles
2

Bauer, Sebastian. "Algorithmische Eigenschaften von Branching-Time Logiken." Doctoral thesis, Technische Universität Dresden, 2005. https://tud.qucosa.de/id/qucosa%3A24981.

Full text
Abstract:
Es wird die Axiomatisierbarkeit einer Klasse von temporalen Prädikatenlogiken über verzweigenden Strukturen gezeigt. Entscheidbarkeitsresultate folgen für diverse Fragmente dieser Logiken. Anwendungen werden diskutiert.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Axiomatizability"

1

Bloom, Stephen L., and Zoltán Ésik. "Nonfinite axiomatizability of shuffle inequalities." In TAPSOFT '95: Theory and Practice of Software Development. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-59293-8_204.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Aceto, Luca, Taolue Chen, Wan Fokkink, and Anna Ingolfsdottir. "On the Axiomatizability of Priority." In Automata, Languages and Programming. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11787006_41.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Scott, Dana. "Completeness and Axiomatizability in Many-Valued Logic." In Universal Logic: An Anthology. Springer Basel, 2012. http://dx.doi.org/10.1007/978-3-0346-0145-0_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

ésik, Zoltán, and Michael Bertol. "Nonfinite axiomatizability of the equational theory of shuffle." In Automata, Languages and Programming. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60084-1_60.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Manuel, Corrada C. "On the axiomatizability of sets in a class theory." In Methods in Mathematical Logic. Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/bfb0075307.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Blom, Stefan, Wan Fokkink, and Sumit Nain. "On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces." In Automata, Languages and Programming. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-45061-0_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

"Finite axiomatizability problem." In Bounded Arithmetic, Propositional Logic and Complexity Theory. Cambridge University Press, 1995. http://dx.doi.org/10.1017/cbo9780511529948.011.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Axiomatizability"

1

Mardare, Radu, Prakash Panangaden, and Gordon Plotkin. "On the axiomatizability of quantitative algebras." In 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2017. http://dx.doi.org/10.1109/lics.2017.8005102.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chen, Taolue, and Wan Fokkink. "On the Axiomatizability of Impossible Futures: Preorder versus Equivalence." In 2008 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008). IEEE, 2008. http://dx.doi.org/10.1109/lics.2008.13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Liang, Fei, and Zhe Lin. "On the Decidability of Intuitionistic Tense Logic without Disjunction." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/249.

Full text
Abstract:
Implicative semi-lattices (also known as Brouwerian semi-lattices) are a generalization of Heyting algebras, and have been already well studied both from a logical and an algebraic perspective. In this paper, we consider the variety ISt of the expansions of implicative semi-lattices with tense modal operators, which are algebraic models of the disjunction-free fragment of intuitionistic tense logic. Using methods from algebraic proof theory, we show that the logic of tense implicative semi-lattices has the finite model property. Combining with the finite axiomatizability of the logic, it follo
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography