Logical and semantic frameworks are formal languages used to represent logics, languages and systems. [Prefácio] (2014)
- Authors:
- Autor USP: FINGER, MARCELO - IME
- Unidade: IME
- DOI: 10.1016/j.entcs.2014.06.001
- Assunto: CIÊNCIA DA COMPUTAÇÃO
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Electronic Notes in Theoretical Computer Science
- ISSN: 1571-0661
- Volume/Número/Paginação/Ano: v. 305, p. 1-3, 2014
- Este periódico é de acesso aberto
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: gold
- Licença: cc-by-nc-nd
-
ABNT
FERNÁNDEZ, Maribel. Logical and semantic frameworks are formal languages used to represent logics, languages and systems. [Prefácio]. Electronic Notes in Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.entcs.2014.06.001. Acesso em: 27 set. 2024. , 2014 -
APA
Fernández, M. (2014). Logical and semantic frameworks are formal languages used to represent logics, languages and systems. [Prefácio]. Electronic Notes in Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.entcs.2014.06.001 -
NLM
Fernández M. Logical and semantic frameworks are formal languages used to represent logics, languages and systems. [Prefácio] [Internet]. Electronic Notes in Theoretical Computer Science. 2014 ; 305 1-3.[citado 2024 set. 27 ] Available from: https://doi.org/10.1016/j.entcs.2014.06.001 -
Vancouver
Fernández M. Logical and semantic frameworks are formal languages used to represent logics, languages and systems. [Prefácio] [Internet]. Electronic Notes in Theoretical Computer Science. 2014 ; 305 1-3.[citado 2024 set. 27 ] Available from: https://doi.org/10.1016/j.entcs.2014.06.001 - Técnicas de otimização da precisão empregadas no etiquetador Tycho Brahe
- Concurrency control for perceivedly instantaneous transactions in valid-time databases
- Resource use pattern analysis for predicting resource availability in opportunistic grids
- Completeness for cut-based abduction
- On the predictability of classical propositional logic
- Automated classification of pathology reports
- Minimal axiomatizations and algebraic rings: a conjectured relationship
- Towards an efficient prover for the C1 paraconsistent logic
- Computational solutions for structural constraints: learning structural permissions in categorial grammar
- Towards polynomial approximations of full propositional logic
Informações sobre o DOI: 10.1016/j.entcs.2014.06.001 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
