One-and-a-halfth-order Logic
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2007/11/22
-
Journal
-
Indian UGC (journal)
-
Refrences23
-
Citations17
-
M. J. Gabbay
-
A. Mathijssen
Cite
Gabbay, M. J., and A. Mathijssen. “One-and-a-Halfth-Order Logic”. Journal of Logic and Computation, vol. 18, no. 4, 2007, pp. 521-62, https://doi.org/10.1093/logcom/exm064.
Gabbay, M. J., & Mathijssen, A. (2007). One-and-a-halfth-order Logic. Journal of Logic and Computation, 18(4), 521-562. https://doi.org/10.1093/logcom/exm064
Gabbay MJ, Mathijssen A. One-and-a-halfth-order Logic. Journal of Logic and Computation. 2007;18(4):521-62.
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
You May Also Like
- Bayesian optimization for learning gaits under uncertainty
- A new stochastic approach for solution of Riccati differential equation of fractional order
- Efficient Boustrophedon Multi-Robot Coverage: an algorithmic approach
- The DLV system for knowledge representation and reasoning
- Strongly equivalent logic programs
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Nominal rewriting | Information and Computation |
| 44 | 2007 |
| Nominal unification | Theoretical Computer Science |
| 75 | 2004 |
| 10.1023/A:1020542009983 | 2002 | |||
A New Approach to Abstract Syntax with Variable Binding | Formal Aspects of Computing |
| 153 | 2002 |
| 10.1023/A:1013063928696 | 2002 |
Refrences Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 6
is the most frequently represented among the references in this article. It primarily includes studies from Theoretical Computer Science The chart below illustrates the number of referenced publications per year.
Refrences used by this article by year
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
Rensets and Renaming-Based Recursion for Syntax with Bindings Extended Version | Journal of Automated Reasoning |
| 2023 | |
| Simple and subdirectly irreducible finitely supported Cb-sets | Theoretical Computer Science |
| 2018 | |
| Free functor from the category of G-nominal sets to that of 01-G-nominal sets | Soft Computing |
| 2017 | |
| Representation and duality of the untyped λ-calculus in nominal lattice and topological semantics, with a proof of topological completeness | Annals of Pure and Applied Logic |
| 2 | 2017 |
Semantics Out of Context | Journal of the ACM |
| 1 | 2016 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 12
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled A Nominal Axiomatization of the Lambda Calculus and was published in 2009. The most recent citation comes from a 2023 study titled Rensets and Renaming-Based Recursion for Syntax with Bindings Extended Version. This article reached its peak citation in 2012, with 3 citations. It has been cited in 13 different journals, 7% of which are open access. Among related journals, the Journal of Logic and Computation cited this research the most, with 3 citations. The chart below illustrates the annual citation trends for this article.